H-Termination proof of /home/matraf/haskell/eval_FullyBlown

MAYBE 8.82 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could not be shown:

↳ HASKELL

  ↳ IFR

mainModule Main

((realToFrac :: Real a => a -> Float) :: Real a => a -> Float)

module Main where

import qualified Prelude

If Reductions:
The following If expression

if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero

is transformed to

primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y))

primDivNatS0 x y False = Zero

The following If expression

if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x

is transformed to

primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y)

primModNatS0 x y False = Succ x

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

mainModule Main

((realToFrac :: Real a => a -> Float) :: Real a => a -> Float)

module Main where

import qualified Prelude

Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

mainModule Main

((realToFrac :: Real a => a -> Float) :: Real a => a -> Float)

module Main where

import qualified Prelude

Cond Reductions:
The following Function with conditions

gcd' x 0 = x

gcd' x y = gcd' y (x `rem` y)

is transformed to

gcd' x xz = gcd'2 x xz

gcd' x y = gcd'0 x y

gcd'0 x y = gcd' y (x `rem` y)

gcd'1 True x xz = x

gcd'1 yu yv yw = gcd'0 yv yw

gcd'2 x xz = gcd'1 (xz == 0) x xz

gcd'2 yx yy = gcd'0 yx yy

The following Function with conditions

gcd 0 0 = error []

gcd x y =

gcd' (abs x) (abs y)

where

gcd' x 0 = x

gcd' x y = gcd' y (x `rem` y)

is transformed to

gcd yz zu = gcd3 yz zu

gcd x y = gcd0 x y

gcd0 x y =

gcd' (abs x) (abs y)

where

gcd' x xz = gcd'2 x xz

gcd' x y = gcd'0 x y

gcd'0 x y = gcd' y (x `rem` y)

gcd'1 True x xz = x

gcd'1 yu yv yw = gcd'0 yv yw

gcd'2 x xz = gcd'1 (xz == 0) x xz

gcd'2 yx yy = gcd'0 yx yy

gcd1 True yz zu = error []

gcd1 zv zw zx = gcd0 zw zx

gcd2 True yz zu = gcd1 (zu == 0) yz zu

gcd2 zy zz vuu = gcd0 zz vuu

gcd3 yz zu = gcd2 (yz == 0) yz zu

gcd3 vuv vuw = gcd0 vuv vuw

The following Function with conditions

absReal x

| x >= 0

= x

| otherwise

= `negate` x

is transformed to

absReal x = absReal2 x

absReal0 x True = `negate` x

absReal1 x True = x

absReal1 x False = absReal0 x otherwise

absReal2 x = absReal1 x (x >= 0)

The following Function with conditions

undefined

| False

= undefined

is transformed to

undefined = undefined1

undefined0 True = undefined

undefined1 = undefined0 False

The following Function with conditions

reduce x y

| y == 0

= error []

| otherwise

= x `quot` d :% (y `quot` d)

where

d = gcd x y

is transformed to

reduce x y = reduce2 x y

reduce2 x y =

reduce1 x y (y == 0)

where

d = gcd x y

reduce0 x y True = x `quot` d :% (y `quot` d)

reduce1 x y True = error []

reduce1 x y False = reduce0 x y otherwise

The following Function with conditions

signumReal x

| x == 0

= 0

| x > 0

= 1

| otherwise

= -1

is transformed to

signumReal x = signumReal3 x

signumReal2 x True = 0

signumReal2 x False = signumReal1 x (x > 0)

signumReal1 x True = 1

signumReal1 x False = signumReal0 x otherwise

signumReal0 x True = -1

signumReal3 x = signumReal2 x (x == 0)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

mainModule Main

((realToFrac :: Real a => a -> Float) :: Real a => a -> Float)

module Main where

import qualified Prelude

Let/Where Reductions:
The bindings of the following Let/Where expression

reduce1 x y (y == 0)

where

d = gcd x y

reduce0 x y True = x `quot` d :% (y `quot` d)

reduce1 x y True = error []

reduce1 x y False = reduce0 x y otherwise

are unpacked to the following functions on top level

reduce2Reduce0 vux vuy x y True = x `quot` reduce2D vux vuy :% (y `quot` reduce2D vux vuy)

reduce2D vux vuy = gcd vux vuy

reduce2Reduce1 vux vuy x y True = error []

reduce2Reduce1 vux vuy x y False = reduce2Reduce0 vux vuy x y otherwise

The bindings of the following Let/Where expression

gcd' (abs x) (abs y)

where

gcd' x xz = gcd'2 x xz

gcd' x y = gcd'0 x y

gcd'0 x y = gcd' y (x `rem` y)

gcd'1 True x xz = x

gcd'1 yu yv yw = gcd'0 yv yw

gcd'2 x xz = gcd'1 (xz == 0) x xz

gcd'2 yx yy = gcd'0 yx yy

are unpacked to the following functions on top level

gcd0Gcd'1 True x xz = x

gcd0Gcd'1 yu yv yw = gcd0Gcd'0 yv yw

gcd0Gcd'0 x y = gcd0Gcd' y (x `rem` y)

gcd0Gcd' x xz = gcd0Gcd'2 x xz

gcd0Gcd' x y = gcd0Gcd'0 x y

gcd0Gcd'2 x xz = gcd0Gcd'1 (xz == 0) x xz

gcd0Gcd'2 yx yy = gcd0Gcd'0 yx yy

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

mainModule Main

((realToFrac :: Real a => a -> Float) :: Real a => a -> Float)

module Main where

import qualified Prelude

Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                      ↳ Narrow

mainModule Main

(realToFrac :: Real a => a -> Float)

module Main where

import qualified Prelude

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="realToFrac\n  Real a",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="realToFrac vuz3\n  Real a",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3];
4[label="fromRational . toRational\n  Real a",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="fromRational (toRational vuz3)\n  Real a",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
6[label="primRationalToFloat (toRational vuz3)\n  Real a",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
7 -> 8[label="",style="dashed", color="red", weight=0];
7[label="rationalToFloat (toRational vuz3)\n  Real a",fontsize=16,color="magenta"];7 -> 9[label="",style="dashed", color="magenta", weight=3];
9[label="toRational vuz3\n  Real a",fontsize=16,color="blue",shape="box"];3326[label="toRational :: Integer -> Ratio Integer",fontsize=10,color="white",style="solid",shape="box"];9 -> 3326[label="",style="solid", color="blue", weight=9];
3326 -> 10[label="",style="solid", color="blue", weight=3];
3327[label="toRational :: Int -> Ratio Integer",fontsize=10,color="white",style="solid",shape="box"];9 -> 3327[label="",style="solid", color="blue", weight=9];
3327 -> 11[label="",style="solid", color="blue", weight=3];
3328[label="toRational :: (Ratio a) -> Ratio Integer",fontsize=10,color="white",style="solid",shape="box"];9 -> 3328[label="",style="solid", color="blue", weight=9];
3328 -> 12[label="",style="solid", color="blue", weight=3];
3329[label="toRational :: Float -> Ratio Integer",fontsize=10,color="white",style="solid",shape="box"];9 -> 3329[label="",style="solid", color="blue", weight=9];
3329 -> 13[label="",style="solid", color="blue", weight=3];
3330[label="toRational :: Double -> Ratio Integer",fontsize=10,color="white",style="solid",shape="box"];9 -> 3330[label="",style="solid", color="blue", weight=9];
3330 -> 14[label="",style="solid", color="blue", weight=3];
8[label="rationalToFloat vuz6",fontsize=16,color="burlywood",shape="triangle"];3331[label="vuz6/vuz60 :% vuz61",fontsize=10,color="white",style="solid",shape="box"];8 -> 3331[label="",style="solid", color="burlywood", weight=9];
3331 -> 15[label="",style="solid", color="burlywood", weight=3];
10[label="toRational vuz3",fontsize=16,color="black",shape="box"];10 -> 16[label="",style="solid", color="black", weight=3];
11[label="toRational vuz3",fontsize=16,color="black",shape="box"];11 -> 17[label="",style="solid", color="black", weight=3];
12[label="toRational vuz3\n  Integral a",fontsize=16,color="burlywood",shape="box"];3332[label="vuz3/vuz30 :% vuz31",fontsize=10,color="white",style="solid",shape="box"];12 -> 3332[label="",style="solid", color="burlywood", weight=9];
3332 -> 18[label="",style="solid", color="burlywood", weight=3];
13[label="toRational vuz3",fontsize=16,color="black",shape="box"];13 -> 19[label="",style="solid", color="black", weight=3];
14[label="toRational vuz3",fontsize=16,color="black",shape="box"];14 -> 20[label="",style="solid", color="black", weight=3];
15[label="rationalToFloat (vuz60 :% vuz61)",fontsize=16,color="burlywood",shape="box"];3333[label="vuz60/Integer vuz600",fontsize=10,color="white",style="solid",shape="box"];15 -> 3333[label="",style="solid", color="burlywood", weight=9];
3333 -> 21[label="",style="solid", color="burlywood", weight=3];
16[label="vuz3 % fromInt (Pos (Succ Zero))",fontsize=16,color="black",shape="triangle"];16 -> 22[label="",style="solid", color="black", weight=3];
17 -> 16[label="",style="dashed", color="red", weight=0];
17[label="toInteger vuz3 % fromInt (Pos (Succ Zero))",fontsize=16,color="magenta"];17 -> 23[label="",style="dashed", color="magenta", weight=3];
18[label="toRational (vuz30 :% vuz31)\n  Integral a",fontsize=16,color="black",shape="box"];18 -> 24[label="",style="solid", color="black", weight=3];
19[label="floatToRational vuz3",fontsize=16,color="burlywood",shape="box"];3335[label="vuz3/Float vuz30 vuz31",fontsize=10,color="white",style="solid",shape="box"];19 -> 3335[label="",style="solid", color="burlywood", weight=9];
3335 -> 25[label="",style="solid", color="burlywood", weight=3];
20[label="doubleToRational vuz3",fontsize=16,color="burlywood",shape="box"];3336[label="vuz3/Double vuz30 vuz31",fontsize=10,color="white",style="solid",shape="box"];20 -> 3336[label="",style="solid", color="burlywood", weight=9];
3336 -> 26[label="",style="solid", color="burlywood", weight=3];
21[label="rationalToFloat (Integer vuz600 :% vuz61)",fontsize=16,color="burlywood",shape="box"];3337[label="vuz61/Integer vuz610",fontsize=10,color="white",style="solid",shape="box"];21 -> 3337[label="",style="solid", color="burlywood", weight=9];
3337 -> 27[label="",style="solid", color="burlywood", weight=3];
22[label="reduce (vuz3 * signum (fromInt (Pos (Succ Zero)))) (abs (fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];22 -> 28[label="",style="solid", color="black", weight=3];
23[label="toInteger vuz3",fontsize=16,color="black",shape="triangle"];23 -> 29[label="",style="solid", color="black", weight=3];
24[label="toInteger vuz30 :% toInteger vuz31\n  Integral a",fontsize=16,color="green",shape="box"];24 -> 30[label="",style="dashed", color="green", weight=3];
24 -> 31[label="",style="dashed", color="green", weight=3];
25[label="floatToRational (Float vuz30 vuz31)",fontsize=16,color="black",shape="box"];25 -> 32[label="",style="solid", color="black", weight=3];
26[label="doubleToRational (Double vuz30 vuz31)",fontsize=16,color="black",shape="box"];26 -> 33[label="",style="solid", color="black", weight=3];
27[label="rationalToFloat (Integer vuz600 :% Integer vuz610)",fontsize=16,color="black",shape="box"];27 -> 34[label="",style="solid", color="black", weight=3];
28[label="reduce2 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (abs (fromInt (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];28 -> 35[label="",style="solid", color="black", weight=3];
29[label="Integer vuz3",fontsize=16,color="green",shape="box"];30[label="toInteger vuz30\n  Integral a",fontsize=16,color="blue",shape="box"];3338[label="toInteger :: Integer -> Integer",fontsize=10,color="white",style="solid",shape="box"];30 -> 3338[label="",style="solid", color="blue", weight=9];
3338 -> 36[label="",style="solid", color="blue", weight=3];
3339[label="toInteger :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];30 -> 3339[label="",style="solid", color="blue", weight=9];
3339 -> 37[label="",style="solid", color="blue", weight=3];
31[label="toInteger vuz31\n  Integral a",fontsize=16,color="blue",shape="box"];3340[label="toInteger :: Integer -> Integer",fontsize=10,color="white",style="solid",shape="box"];31 -> 3340[label="",style="solid", color="blue", weight=9];
3340 -> 38[label="",style="solid", color="blue", weight=3];
3341[label="toInteger :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];31 -> 3341[label="",style="solid", color="blue", weight=9];
3341 -> 39[label="",style="solid", color="blue", weight=3];
32[label="Integer vuz30 % Integer vuz31",fontsize=16,color="black",shape="triangle"];32 -> 40[label="",style="solid", color="black", weight=3];
33 -> 32[label="",style="dashed", color="red", weight=0];
33[label="Integer vuz30 % Integer vuz31",fontsize=16,color="magenta"];33 -> 41[label="",style="dashed", color="magenta", weight=3];
33 -> 42[label="",style="dashed", color="magenta", weight=3];
34[label="Float vuz600 vuz610",fontsize=16,color="green",shape="box"];35[label="reduce2Reduce1 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (abs (fromInt (Pos (Succ Zero)))) (vuz3 * signum (fromInt (Pos (Succ Zero)))) (abs (fromInt (Pos (Succ Zero)))) (abs (fromInt (Pos (Succ Zero))) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];35 -> 43[label="",style="solid", color="black", weight=3];
36[label="toInteger vuz30",fontsize=16,color="black",shape="triangle"];36 -> 44[label="",style="solid", color="black", weight=3];
37 -> 23[label="",style="dashed", color="red", weight=0];
37[label="toInteger vuz30",fontsize=16,color="magenta"];37 -> 45[label="",style="dashed", color="magenta", weight=3];
38 -> 36[label="",style="dashed", color="red", weight=0];
38[label="toInteger vuz31",fontsize=16,color="magenta"];38 -> 46[label="",style="dashed", color="magenta", weight=3];
39 -> 23[label="",style="dashed", color="red", weight=0];
39[label="toInteger vuz31",fontsize=16,color="magenta"];39 -> 47[label="",style="dashed", color="magenta", weight=3];
40[label="reduce (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31))",fontsize=16,color="black",shape="box"];40 -> 48[label="",style="solid", color="black", weight=3];
41[label="vuz31",fontsize=16,color="green",shape="box"];42[label="vuz30",fontsize=16,color="green",shape="box"];43[label="reduce2Reduce1 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal (fromInt (Pos (Succ Zero)))) (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal (fromInt (Pos (Succ Zero)))) (absReal (fromInt (Pos (Succ Zero))) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];43 -> 49[label="",style="solid", color="black", weight=3];
44[label="vuz30",fontsize=16,color="green",shape="box"];45[label="vuz30",fontsize=16,color="green",shape="box"];46[label="vuz31",fontsize=16,color="green",shape="box"];47[label="vuz31",fontsize=16,color="green",shape="box"];48[label="reduce2 (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31))",fontsize=16,color="black",shape="box"];48 -> 50[label="",style="solid", color="black", weight=3];
49[label="reduce2Reduce1 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal2 (fromInt (Pos (Succ Zero)))) (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal2 (fromInt (Pos (Succ Zero)))) (absReal2 (fromInt (Pos (Succ Zero))) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];49 -> 51[label="",style="solid", color="black", weight=3];
50[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31)) (abs (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];50 -> 52[label="",style="solid", color="black", weight=3];
51[label="reduce2Reduce1 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal1 (fromInt (Pos (Succ Zero))) (fromInt (Pos (Succ Zero)) >= fromInt (Pos Zero))) (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal1 (fromInt (Pos (Succ Zero))) (fromInt (Pos (Succ Zero)) >= fromInt (Pos Zero))) (absReal1 (fromInt (Pos (Succ Zero))) (fromInt (Pos (Succ Zero)) >= fromInt (Pos Zero)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];51 -> 53[label="",style="solid", color="black", weight=3];
52[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (absReal (Integer vuz31)) (absReal (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];52 -> 54[label="",style="solid", color="black", weight=3];
53[label="reduce2Reduce1 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal1 (fromInt (Pos (Succ Zero))) (compare (fromInt (Pos (Succ Zero))) (fromInt (Pos Zero)) /= LT)) (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal1 (fromInt (Pos (Succ Zero))) (compare (fromInt (Pos (Succ Zero))) (fromInt (Pos Zero)) /= LT)) (absReal1 (fromInt (Pos (Succ Zero))) (compare (fromInt (Pos (Succ Zero))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];53 -> 55[label="",style="solid", color="black", weight=3];
54[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal2 (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (absReal2 (Integer vuz31)) (absReal2 (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];54 -> 56[label="",style="solid", color="black", weight=3];
55[label="reduce2Reduce1 (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal1 (fromInt (Pos (Succ Zero))) (not (compare (fromInt (Pos (Succ Zero))) (fromInt (Pos Zero)) == LT))) (vuz3 * signum (fromInt (Pos (Succ Zero)))) (absReal1 (fromInt (Pos (Succ Zero))) (not (compare (fromInt (Pos (Succ Zero))) (fromInt (Pos Zero)) == LT))) (absReal1 (fromInt (Pos (Succ Zero))) (not (compare (fromInt (Pos (Succ Zero))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];55 -> 57[label="",style="solid", color="black", weight=3];
56[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero))) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];56 -> 58[label="",style="solid", color="black", weight=3];
57[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == LT))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == LT))) (absReal1 (Integer (Pos (Succ Zero))) (not (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];57 -> 59[label="",style="solid", color="black", weight=3];
58[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT)) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];58 -> 60[label="",style="solid", color="black", weight=3];
59[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == LT))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == LT))) (absReal1 (Integer (Pos (Succ Zero))) (not (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];59 -> 61[label="",style="solid", color="black", weight=3];
60[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT))) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];60 -> 62[label="",style="solid", color="black", weight=3];
61[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos Zero) == LT))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos Zero) == LT))) (absReal1 (Integer (Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];61 -> 63[label="",style="solid", color="black", weight=3];
62[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT))) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];62 -> 64[label="",style="solid", color="black", weight=3];
63[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (primCmpNat (Succ Zero) Zero == LT))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (primCmpNat (Succ Zero) Zero == LT))) (absReal1 (Integer (Pos (Succ Zero))) (not (primCmpNat (Succ Zero) Zero == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];63 -> 65[label="",style="solid", color="black", weight=3];
64[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (primCmpInt vuz31 (Pos Zero) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (primCmpInt vuz31 (Pos Zero) == LT))) (absReal1 (Integer vuz31) (not (primCmpInt vuz31 (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="burlywood",shape="box"];3346[label="vuz31/Pos vuz310",fontsize=10,color="white",style="solid",shape="box"];64 -> 3346[label="",style="solid", color="burlywood", weight=9];
3346 -> 66[label="",style="solid", color="burlywood", weight=3];
3347[label="vuz31/Neg vuz310",fontsize=10,color="white",style="solid",shape="box"];64 -> 3347[label="",style="solid", color="burlywood", weight=9];
3347 -> 67[label="",style="solid", color="burlywood", weight=3];
65[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (GT == LT))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not (GT == LT))) (absReal1 (Integer (Pos (Succ Zero))) (not (GT == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];65 -> 68[label="",style="solid", color="black", weight=3];
66[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos vuz310))) (absReal1 (Integer (Pos vuz310)) (not (primCmpInt (Pos vuz310) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Pos vuz310))) (absReal1 (Integer (Pos vuz310)) (not (primCmpInt (Pos vuz310) (Pos Zero) == LT))) (absReal1 (Integer (Pos vuz310)) (not (primCmpInt (Pos vuz310) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="burlywood",shape="box"];3348[label="vuz310/Succ vuz3100",fontsize=10,color="white",style="solid",shape="box"];66 -> 3348[label="",style="solid", color="burlywood", weight=9];
3348 -> 69[label="",style="solid", color="burlywood", weight=3];
3349[label="vuz310/Zero",fontsize=10,color="white",style="solid",shape="box"];66 -> 3349[label="",style="solid", color="burlywood", weight=9];
3349 -> 70[label="",style="solid", color="burlywood", weight=3];
67[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg vuz310))) (absReal1 (Integer (Neg vuz310)) (not (primCmpInt (Neg vuz310) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Neg vuz310))) (absReal1 (Integer (Neg vuz310)) (not (primCmpInt (Neg vuz310) (Pos Zero) == LT))) (absReal1 (Integer (Neg vuz310)) (not (primCmpInt (Neg vuz310) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="burlywood",shape="box"];3350[label="vuz310/Succ vuz3100",fontsize=10,color="white",style="solid",shape="box"];67 -> 3350[label="",style="solid", color="burlywood", weight=9];
3350 -> 71[label="",style="solid", color="burlywood", weight=3];
3351[label="vuz310/Zero",fontsize=10,color="white",style="solid",shape="box"];67 -> 3351[label="",style="solid", color="burlywood", weight=9];
3351 -> 72[label="",style="solid", color="burlywood", weight=3];
68[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not False)) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) (not False)) (absReal1 (Integer (Pos (Succ Zero))) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];68 -> 73[label="",style="solid", color="black", weight=3];
69[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];69 -> 74[label="",style="solid", color="black", weight=3];
70[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];70 -> 75[label="",style="solid", color="black", weight=3];
71[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == LT))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];71 -> 76[label="",style="solid", color="black", weight=3];
72[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];72 -> 77[label="",style="solid", color="black", weight=3];
73[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) True) (vuz3 * signum (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ Zero))) True) (absReal1 (Integer (Pos (Succ Zero))) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];73 -> 78[label="",style="solid", color="black", weight=3];
74[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];74 -> 79[label="",style="solid", color="black", weight=3];
75[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT))) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];75 -> 80[label="",style="solid", color="black", weight=3];
76[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (LT == LT))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (LT == LT))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (LT == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];76 -> 81[label="",style="solid", color="black", weight=3];
77[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT))) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];77 -> 82[label="",style="solid", color="black", weight=3];
78[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];78 -> 83[label="",style="solid", color="black", weight=3];
79[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];79 -> 84[label="",style="solid", color="black", weight=3];
80[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not False)) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not False)) (absReal1 (Integer (Pos Zero)) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];80 -> 85[label="",style="solid", color="black", weight=3];
81[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not True)) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not True)) (absReal1 (Integer (Neg (Succ vuz3100))) (not True) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];81 -> 86[label="",style="solid", color="black", weight=3];
82[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not False)) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not False)) (absReal1 (Integer (Neg Zero)) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];82 -> 87[label="",style="solid", color="black", weight=3];
83[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];83 -> 88[label="",style="solid", color="black", weight=3];
84[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False)) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False)) (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];84 -> 89[label="",style="solid", color="black", weight=3];
85[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) True) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) True) (absReal1 (Integer (Pos Zero)) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];85 -> 90[label="",style="solid", color="black", weight=3];
86[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) False) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) False) (absReal1 (Integer (Neg (Succ vuz3100))) False == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];86 -> 91[label="",style="solid", color="black", weight=3];
87[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) True) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) True) (absReal1 (Integer (Neg Zero)) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];87 -> 92[label="",style="solid", color="black", weight=3];
88[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (primEqInt (Pos (Succ Zero)) (Pos Zero))",fontsize=16,color="black",shape="box"];88 -> 93[label="",style="solid", color="black", weight=3];
89[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) True) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) True) (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];89 -> 94[label="",style="solid", color="black", weight=3];
90[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer (Pos Zero) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];90 -> 95[label="",style="solid", color="black", weight=3];
91[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) otherwise) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) otherwise) (absReal0 (Integer (Neg (Succ vuz3100))) otherwise == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];91 -> 96[label="",style="solid", color="black", weight=3];
92[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer (Neg Zero) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];92 -> 97[label="",style="solid", color="black", weight=3];
93[label="reduce2Reduce1 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];93 -> 98[label="",style="solid", color="black", weight=3];
94[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];94 -> 99[label="",style="solid", color="black", weight=3];
95[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer (Pos Zero) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];95 -> 100[label="",style="solid", color="black", weight=3];
96[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) True) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) True) (absReal0 (Integer (Neg (Succ vuz3100))) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];96 -> 101[label="",style="solid", color="black", weight=3];
97[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer (Neg Zero) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];97 -> 102[label="",style="solid", color="black", weight=3];
98[label="reduce2Reduce0 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];98 -> 103[label="",style="solid", color="black", weight=3];
99[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];99 -> 104[label="",style="solid", color="black", weight=3];
100[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (primEqInt (Pos Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];100 -> 105[label="",style="solid", color="black", weight=3];
101[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (`negate` Integer (Neg (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (`negate` Integer (Neg (Succ vuz3100))) (`negate` Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];101 -> 106[label="",style="solid", color="black", weight=3];
102[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (primEqInt (Neg Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];102 -> 107[label="",style="solid", color="black", weight=3];
103[label="reduce2Reduce0 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];103 -> 108[label="",style="solid", color="black", weight=3];
104[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))",fontsize=16,color="black",shape="box"];104 -> 109[label="",style="solid", color="black", weight=3];
105[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) True",fontsize=16,color="black",shape="box"];105 -> 110[label="",style="solid", color="black", weight=3];
106[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100))) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];106 -> 111[label="",style="solid", color="black", weight=3];
107[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) True",fontsize=16,color="black",shape="box"];107 -> 112[label="",style="solid", color="black", weight=3];
108[label="vuz3 * signum (Integer (Pos (Succ Zero))) `quot` reduce2D (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))) :% (Integer (Pos (Succ Zero)) `quot` reduce2D (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero))))",fontsize=16,color="green",shape="box"];108 -> 113[label="",style="dashed", color="green", weight=3];
108 -> 114[label="",style="dashed", color="green", weight=3];
109[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) False",fontsize=16,color="black",shape="box"];109 -> 115[label="",style="solid", color="black", weight=3];
110[label="error []",fontsize=16,color="black",shape="triangle"];110 -> 116[label="",style="solid", color="black", weight=3];
111[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100))) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];111 -> 117[label="",style="solid", color="black", weight=3];
112 -> 110[label="",style="dashed", color="red", weight=0];
112[label="error []",fontsize=16,color="magenta"];113[label="vuz3 * signum (Integer (Pos (Succ Zero))) `quot` reduce2D (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="burlywood",shape="box"];3353[label="vuz3/Integer vuz30",fontsize=10,color="white",style="solid",shape="box"];113 -> 3353[label="",style="solid", color="burlywood", weight=9];
3353 -> 118[label="",style="solid", color="burlywood", weight=3];
114[label="Integer (Pos (Succ Zero)) `quot` reduce2D (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];114 -> 119[label="",style="solid", color="black", weight=3];
115[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) otherwise",fontsize=16,color="black",shape="box"];115 -> 120[label="",style="solid", color="black", weight=3];
116[label="error []",fontsize=16,color="red",shape="box"];117[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (primEqInt (primNegInt (Neg (Succ vuz3100))) (Pos Zero))",fontsize=16,color="black",shape="box"];117 -> 121[label="",style="solid", color="black", weight=3];
118[label="Integer vuz30 * signum (Integer (Pos (Succ Zero))) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];118 -> 122[label="",style="solid", color="black", weight=3];
119[label="Integer (Pos (Succ Zero)) `quot` gcd (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];119 -> 123[label="",style="solid", color="black", weight=3];
120[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) True",fontsize=16,color="black",shape="box"];120 -> 124[label="",style="solid", color="black", weight=3];
121[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))",fontsize=16,color="black",shape="box"];121 -> 125[label="",style="solid", color="black", weight=3];
122[label="Integer vuz30 * signumReal (Integer (Pos (Succ Zero))) `quot` reduce2D (Integer vuz30 * signumReal (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];122 -> 126[label="",style="solid", color="black", weight=3];
123[label="Integer (Pos (Succ Zero)) `quot` gcd3 (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];123 -> 127[label="",style="solid", color="black", weight=3];
124[label="Integer vuz30 * signum (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) :% (Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))))",fontsize=16,color="green",shape="box"];124 -> 128[label="",style="dashed", color="green", weight=3];
124 -> 129[label="",style="dashed", color="green", weight=3];
125[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) False",fontsize=16,color="black",shape="box"];125 -> 130[label="",style="solid", color="black", weight=3];
126[label="Integer vuz30 * signumReal3 (Integer (Pos (Succ Zero))) `quot` reduce2D (Integer vuz30 * signumReal3 (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];126 -> 131[label="",style="solid", color="black", weight=3];
127[label="Integer (Pos (Succ Zero)) `quot` gcd2 (vuz3 * signum (Integer (Pos (Succ Zero))) == fromInt (Pos Zero)) (vuz3 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="burlywood",shape="box"];3354[label="vuz3/Integer vuz30",fontsize=10,color="white",style="solid",shape="box"];127 -> 3354[label="",style="solid", color="burlywood", weight=9];
3354 -> 132[label="",style="solid", color="burlywood", weight=3];
128[label="Integer vuz30 * signum (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];128 -> 133[label="",style="solid", color="black", weight=3];
129[label="Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];129 -> 134[label="",style="solid", color="black", weight=3];
130[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) otherwise",fontsize=16,color="black",shape="box"];130 -> 135[label="",style="solid", color="black", weight=3];
131[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == fromInt (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];131 -> 136[label="",style="solid", color="black", weight=3];
132[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signum (Integer (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer vuz30 * signum (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];132 -> 137[label="",style="solid", color="black", weight=3];
133[label="Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];133 -> 138[label="",style="solid", color="black", weight=3];
134[label="Integer (Pos (Succ vuz3100)) `quot` gcd (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];134 -> 139[label="",style="solid", color="black", weight=3];
135[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) True",fontsize=16,color="black",shape="box"];135 -> 140[label="",style="solid", color="black", weight=3];
136[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == Integer (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == Integer (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];136 -> 141[label="",style="solid", color="black", weight=3];
137[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal (Integer (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];137 -> 142[label="",style="solid", color="black", weight=3];
138[label="Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];138 -> 143[label="",style="solid", color="black", weight=3];
139[label="Integer (Pos (Succ vuz3100)) `quot` gcd3 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];139 -> 144[label="",style="solid", color="black", weight=3];
140[label="Integer vuz30 * signum (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) :% (Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))))",fontsize=16,color="green",shape="box"];140 -> 145[label="",style="dashed", color="green", weight=3];
140 -> 146[label="",style="dashed", color="green", weight=3];
141[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (primEqInt (Pos (Succ Zero)) (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (primEqInt (Pos (Succ Zero)) (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];141 -> 147[label="",style="solid", color="black", weight=3];
142[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal3 (Integer (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal3 (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];142 -> 148[label="",style="solid", color="black", weight=3];
143[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];143 -> 149[label="",style="solid", color="black", weight=3];
144[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];144 -> 150[label="",style="solid", color="black", weight=3];
145[label="Integer vuz30 * signum (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];145 -> 151[label="",style="solid", color="black", weight=3];
146[label="Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];146 -> 152[label="",style="solid", color="black", weight=3];
147[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) False `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) False) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];147 -> 153[label="",style="solid", color="black", weight=3];
148[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == fromInt (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];148 -> 154[label="",style="solid", color="black", weight=3];
149[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];149 -> 155[label="",style="solid", color="black", weight=3];
150[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];150 -> 156[label="",style="solid", color="black", weight=3];
151[label="Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];151 -> 157[label="",style="solid", color="black", weight=3];
152[label="Integer (Pos (Succ vuz3100)) `quot` gcd (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];152 -> 158[label="",style="solid", color="black", weight=3];
153[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) > fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) > fromInt (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];153 -> 159[label="",style="solid", color="black", weight=3];
154[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == Integer (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) == Integer (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];154 -> 160[label="",style="solid", color="black", weight=3];
155[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];155 -> 161[label="",style="solid", color="black", weight=3];
156[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];156 -> 162[label="",style="solid", color="black", weight=3];
157[label="Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];157 -> 163[label="",style="solid", color="black", weight=3];
158[label="Integer (Pos (Succ vuz3100)) `quot` gcd3 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];158 -> 164[label="",style="solid", color="black", weight=3];
159[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];159 -> 165[label="",style="solid", color="black", weight=3];
160[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (primEqInt (Pos (Succ Zero)) (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) (primEqInt (Pos (Succ Zero)) (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];160 -> 166[label="",style="solid", color="black", weight=3];
161[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];161 -> 167[label="",style="solid", color="black", weight=3];
162[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];162 -> 168[label="",style="solid", color="black", weight=3];
163[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];163 -> 169[label="",style="solid", color="black", weight=3];
164[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];164 -> 170[label="",style="solid", color="black", weight=3];
165[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];165 -> 171[label="",style="solid", color="black", weight=3];
166[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ Zero))) False) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];166 -> 172[label="",style="solid", color="black", weight=3];
167[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];167 -> 173[label="",style="solid", color="black", weight=3];
168[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];168 -> 174[label="",style="solid", color="black", weight=3];
169[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];169 -> 175[label="",style="solid", color="black", weight=3];
170[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];170 -> 176[label="",style="solid", color="black", weight=3];
171[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpInt (Pos (Succ Zero)) (Pos Zero) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpInt (Pos (Succ Zero)) (Pos Zero) == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];171 -> 177[label="",style="solid", color="black", weight=3];
172[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) > fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) > fromInt (Pos Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];172 -> 178[label="",style="solid", color="black", weight=3];
173[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];173 -> 179[label="",style="solid", color="black", weight=3];
174[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];174 -> 180[label="",style="solid", color="black", weight=3];
175[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];175 -> 181[label="",style="solid", color="black", weight=3];
176[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];176 -> 182[label="",style="solid", color="black", weight=3];
177[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpNat (Succ Zero) Zero == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpNat (Succ Zero) Zero == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];177 -> 183[label="",style="solid", color="black", weight=3];
178[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];178 -> 184[label="",style="solid", color="black", weight=3];
179[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];179 -> 185[label="",style="solid", color="black", weight=3];
180[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];180 -> 186[label="",style="solid", color="black", weight=3];
181[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];181 -> 187[label="",style="solid", color="black", weight=3];
182[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];182 -> 188[label="",style="solid", color="black", weight=3];
183[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (GT == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (GT == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];183 -> 189[label="",style="solid", color="black", weight=3];
184[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (compare (Integer (Pos (Succ Zero))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];184 -> 190[label="",style="solid", color="black", weight=3];
185[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];185 -> 191[label="",style="solid", color="black", weight=3];
186[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];186 -> 192[label="",style="solid", color="black", weight=3];
187[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];187 -> 193[label="",style="solid", color="black", weight=3];
188[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];188 -> 194[label="",style="solid", color="black", weight=3];
189[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) True `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) True) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];189 -> 195[label="",style="solid", color="black", weight=3];
190[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpInt (Pos (Succ Zero)) (Pos Zero) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpInt (Pos (Succ Zero)) (Pos Zero) == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];190 -> 196[label="",style="solid", color="black", weight=3];
191[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];191 -> 197[label="",style="solid", color="black", weight=3];
192[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];192 -> 198[label="",style="solid", color="black", weight=3];
193[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];193 -> 199[label="",style="solid", color="black", weight=3];
194[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];194 -> 200[label="",style="solid", color="black", weight=3];
195[label="Integer vuz30 * fromInt (Pos (Succ Zero)) `quot` reduce2D (Integer vuz30 * fromInt (Pos (Succ Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];195 -> 201[label="",style="solid", color="black", weight=3];
196[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpNat (Succ Zero) Zero == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (primCmpNat (Succ Zero) Zero == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];196 -> 202[label="",style="solid", color="black", weight=3];
197[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];197 -> 203[label="",style="solid", color="black", weight=3];
198[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];198 -> 204[label="",style="solid", color="black", weight=3];
199[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];199 -> 205[label="",style="solid", color="black", weight=3];
200[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];200 -> 206[label="",style="solid", color="black", weight=3];
201[label="Integer vuz30 * Integer (Pos (Succ Zero)) `quot` reduce2D (Integer vuz30 * Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];201 -> 207[label="",style="solid", color="black", weight=3];
202[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (GT == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) (GT == GT)) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];202 -> 208[label="",style="solid", color="black", weight=3];
203[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];203 -> 209[label="",style="solid", color="black", weight=3];
204[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];204 -> 210[label="",style="solid", color="black", weight=3];
205[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];205 -> 211[label="",style="solid", color="black", weight=3];
206[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];206 -> 212[label="",style="solid", color="black", weight=3];
207[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` reduce2D (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];207 -> 213[label="",style="solid", color="black", weight=3];
208[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) True == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ Zero))) True) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];208 -> 214[label="",style="solid", color="black", weight=3];
209[label="Integer vuz30 * fromInt (Pos (Succ Zero)) `quot` reduce2D (Integer vuz30 * fromInt (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];209 -> 215[label="",style="solid", color="black", weight=3];
210[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];210 -> 216[label="",style="solid", color="black", weight=3];
211[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];211 -> 217[label="",style="solid", color="black", weight=3];
212[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];212 -> 218[label="",style="solid", color="black", weight=3];
213[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];213 -> 219[label="",style="solid", color="black", weight=3];
214[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * fromInt (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * fromInt (Pos (Succ Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];214 -> 220[label="",style="solid", color="black", weight=3];
215[label="Integer vuz30 * Integer (Pos (Succ Zero)) `quot` reduce2D (Integer vuz30 * Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];215 -> 221[label="",style="solid", color="black", weight=3];
216[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];216 -> 222[label="",style="solid", color="black", weight=3];
217[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];217 -> 223[label="",style="solid", color="black", weight=3];
218[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];218 -> 224[label="",style="solid", color="black", weight=3];
219[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd3 (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];219 -> 225[label="",style="solid", color="black", weight=3];
220[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer vuz30 * Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];220 -> 226[label="",style="solid", color="black", weight=3];
221[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` reduce2D (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];221 -> 227[label="",style="solid", color="black", weight=3];
222[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];222 -> 228[label="",style="solid", color="black", weight=3];
223[label="Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise `quot` reduce2D (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];223 -> 229[label="",style="solid", color="black", weight=3];
224[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];224 -> 230[label="",style="solid", color="black", weight=3];
225[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];225 -> 231[label="",style="solid", color="black", weight=3];
226[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];226 -> 232[label="",style="solid", color="black", weight=3];
227[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];227 -> 233[label="",style="solid", color="black", weight=3];
228[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * fromInt (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * fromInt (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];228 -> 234[label="",style="solid", color="black", weight=3];
229[label="Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True `quot` reduce2D (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];229 -> 235[label="",style="solid", color="black", weight=3];
230[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];230 -> 236[label="",style="solid", color="black", weight=3];
231[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];231 -> 237[label="",style="solid", color="black", weight=3];
232[label="Integer (Pos (Succ Zero)) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];232 -> 238[label="",style="solid", color="black", weight=3];
233[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd3 (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];233 -> 239[label="",style="solid", color="black", weight=3];
234[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];234 -> 240[label="",style="solid", color="black", weight=3];
235[label="Integer vuz30 * fromInt (Neg (Succ Zero)) `quot` reduce2D (Integer vuz30 * fromInt (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];235 -> 241[label="",style="solid", color="black", weight=3];
236[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];236 -> 242[label="",style="solid", color="black", weight=3];
237[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt vuz30 (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="burlywood",shape="box"];3355[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];237 -> 3355[label="",style="solid", color="burlywood", weight=9];
3355 -> 243[label="",style="solid", color="burlywood", weight=3];
3356[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];237 -> 3356[label="",style="solid", color="burlywood", weight=9];
3356 -> 244[label="",style="solid", color="burlywood", weight=3];
238[label="Integer (Pos (Succ Zero)) `quot` gcd2 (primEqInt (primMulInt vuz30 (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="burlywood",shape="box"];3357[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];238 -> 3357[label="",style="solid", color="burlywood", weight=9];
3357 -> 245[label="",style="solid", color="burlywood", weight=3];
3358[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];238 -> 3358[label="",style="solid", color="burlywood", weight=9];
3358 -> 246[label="",style="solid", color="burlywood", weight=3];
239[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];239 -> 247[label="",style="solid", color="black", weight=3];
240[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];240 -> 248[label="",style="solid", color="black", weight=3];
241[label="Integer vuz30 * Integer (Neg (Succ Zero)) `quot` reduce2D (Integer vuz30 * Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];241 -> 249[label="",style="solid", color="black", weight=3];
242[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise == fromInt (Pos Zero)) (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];242 -> 250[label="",style="solid", color="black", weight=3];
243[label="Integer (primMulInt (Pos vuz300) (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];243 -> 251[label="",style="solid", color="black", weight=3];
244[label="Integer (primMulInt (Neg vuz300) (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];244 -> 252[label="",style="solid", color="black", weight=3];
245[label="Integer (Pos (Succ Zero)) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];245 -> 253[label="",style="solid", color="black", weight=3];
246[label="Integer (Pos (Succ Zero)) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];246 -> 254[label="",style="solid", color="black", weight=3];
247[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];247 -> 255[label="",style="solid", color="black", weight=3];
248[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];248 -> 256[label="",style="solid", color="black", weight=3];
249[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` reduce2D (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];249 -> 257[label="",style="solid", color="black", weight=3];
250[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True == fromInt (Pos Zero)) (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];250 -> 258[label="",style="solid", color="black", weight=3];
251 -> 829[label="",style="dashed", color="red", weight=0];
251[label="Integer (Pos (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];251 -> 830[label="",style="dashed", color="magenta", weight=3];
251 -> 831[label="",style="dashed", color="magenta", weight=3];
251 -> 832[label="",style="dashed", color="magenta", weight=3];
251 -> 833[label="",style="dashed", color="magenta", weight=3];
252 -> 989[label="",style="dashed", color="red", weight=0];
252[label="Integer (Neg (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];252 -> 990[label="",style="dashed", color="magenta", weight=3];
252 -> 991[label="",style="dashed", color="magenta", weight=3];
252 -> 992[label="",style="dashed", color="magenta", weight=3];
252 -> 993[label="",style="dashed", color="magenta", weight=3];
253 -> 829[label="",style="dashed", color="red", weight=0];
253[label="Integer (Pos (Succ Zero)) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];253 -> 834[label="",style="dashed", color="magenta", weight=3];
253 -> 835[label="",style="dashed", color="magenta", weight=3];
253 -> 836[label="",style="dashed", color="magenta", weight=3];
253 -> 837[label="",style="dashed", color="magenta", weight=3];
254 -> 1083[label="",style="dashed", color="red", weight=0];
254[label="Integer (Pos (Succ Zero)) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];254 -> 1084[label="",style="dashed", color="magenta", weight=3];
254 -> 1085[label="",style="dashed", color="magenta", weight=3];
254 -> 1086[label="",style="dashed", color="magenta", weight=3];
255[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt vuz30 (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3363[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];255 -> 3363[label="",style="solid", color="burlywood", weight=9];
3363 -> 267[label="",style="solid", color="burlywood", weight=3];
3364[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];255 -> 3364[label="",style="solid", color="burlywood", weight=9];
3364 -> 268[label="",style="solid", color="burlywood", weight=3];
256[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt vuz30 (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3365[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];256 -> 3365[label="",style="solid", color="burlywood", weight=9];
3365 -> 269[label="",style="solid", color="burlywood", weight=3];
3366[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];256 -> 3366[label="",style="solid", color="burlywood", weight=9];
3366 -> 270[label="",style="solid", color="burlywood", weight=3];
257[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];257 -> 271[label="",style="solid", color="black", weight=3];
258[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * fromInt (Neg (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * fromInt (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];258 -> 272[label="",style="solid", color="black", weight=3];
830[label="Zero",fontsize=16,color="green",shape="box"];831 -> 661[label="",style="dashed", color="red", weight=0];
831[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];831 -> 966[label="",style="dashed", color="magenta", weight=3];
832 -> 661[label="",style="dashed", color="red", weight=0];
832[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];832 -> 967[label="",style="dashed", color="magenta", weight=3];
833 -> 661[label="",style="dashed", color="red", weight=0];
833[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];833 -> 968[label="",style="dashed", color="magenta", weight=3];
829[label="Integer (Pos vuz45) `quot` gcd2 (primEqInt (Pos vuz47) (Pos Zero)) (Integer (Pos vuz46)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];3370[label="vuz47/Succ vuz470",fontsize=10,color="white",style="solid",shape="box"];829 -> 3370[label="",style="solid", color="burlywood", weight=9];
3370 -> 969[label="",style="solid", color="burlywood", weight=3];
3371[label="vuz47/Zero",fontsize=10,color="white",style="solid",shape="box"];829 -> 3371[label="",style="solid", color="burlywood", weight=9];
3371 -> 970[label="",style="solid", color="burlywood", weight=3];
990[label="Zero",fontsize=16,color="green",shape="box"];991 -> 661[label="",style="dashed", color="red", weight=0];
991[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];991 -> 1066[label="",style="dashed", color="magenta", weight=3];
992 -> 661[label="",style="dashed", color="red", weight=0];
992[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];992 -> 1067[label="",style="dashed", color="magenta", weight=3];
993 -> 661[label="",style="dashed", color="red", weight=0];
993[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];993 -> 1068[label="",style="dashed", color="magenta", weight=3];
989[label="Integer (Neg vuz63) `quot` gcd2 (primEqInt (Neg vuz65) (Pos Zero)) (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];3375[label="vuz65/Succ vuz650",fontsize=10,color="white",style="solid",shape="box"];989 -> 3375[label="",style="solid", color="burlywood", weight=9];
3375 -> 1069[label="",style="solid", color="burlywood", weight=3];
3376[label="vuz65/Zero",fontsize=10,color="white",style="solid",shape="box"];989 -> 3376[label="",style="solid", color="burlywood", weight=9];
3376 -> 1070[label="",style="solid", color="burlywood", weight=3];
834[label="Zero",fontsize=16,color="green",shape="box"];835 -> 661[label="",style="dashed", color="red", weight=0];
835[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];835 -> 971[label="",style="dashed", color="magenta", weight=3];
836[label="Succ Zero",fontsize=16,color="green",shape="box"];837 -> 661[label="",style="dashed", color="red", weight=0];
837[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];837 -> 972[label="",style="dashed", color="magenta", weight=3];
1084[label="Zero",fontsize=16,color="green",shape="box"];1085 -> 661[label="",style="dashed", color="red", weight=0];
1085[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1085 -> 1125[label="",style="dashed", color="magenta", weight=3];
1086 -> 661[label="",style="dashed", color="red", weight=0];
1086[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1086 -> 1126[label="",style="dashed", color="magenta", weight=3];
1083[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg vuz82) (Pos Zero)) (Integer (Neg vuz81)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];3381[label="vuz82/Succ vuz820",fontsize=10,color="white",style="solid",shape="box"];1083 -> 3381[label="",style="solid", color="burlywood", weight=9];
3381 -> 1127[label="",style="solid", color="burlywood", weight=3];
3382[label="vuz82/Zero",fontsize=10,color="white",style="solid",shape="box"];1083 -> 3382[label="",style="solid", color="burlywood", weight=9];
3382 -> 1128[label="",style="solid", color="burlywood", weight=3];
267[label="Integer (primMulInt (Pos vuz300) (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];267 -> 281[label="",style="solid", color="black", weight=3];
268[label="Integer (primMulInt (Neg vuz300) (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];268 -> 282[label="",style="solid", color="black", weight=3];
269[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];269 -> 283[label="",style="solid", color="black", weight=3];
270[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];270 -> 284[label="",style="solid", color="black", weight=3];
271[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd3 (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];271 -> 285[label="",style="solid", color="black", weight=3];
272[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * Integer (Neg (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];272 -> 286[label="",style="solid", color="black", weight=3];
966[label="vuz300",fontsize=16,color="green",shape="box"];661[label="primMulNat vuz3000 (Succ Zero)",fontsize=16,color="burlywood",shape="triangle"];3383[label="vuz3000/Succ vuz30000",fontsize=10,color="white",style="solid",shape="box"];661 -> 3383[label="",style="solid", color="burlywood", weight=9];
3383 -> 677[label="",style="solid", color="burlywood", weight=3];
3384[label="vuz3000/Zero",fontsize=10,color="white",style="solid",shape="box"];661 -> 3384[label="",style="solid", color="burlywood", weight=9];
3384 -> 678[label="",style="solid", color="burlywood", weight=3];
967[label="vuz300",fontsize=16,color="green",shape="box"];968[label="vuz300",fontsize=16,color="green",shape="box"];969[label="Integer (Pos vuz45) `quot` gcd2 (primEqInt (Pos (Succ vuz470)) (Pos Zero)) (Integer (Pos vuz46)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];969 -> 1071[label="",style="solid", color="black", weight=3];
970[label="Integer (Pos vuz45) `quot` gcd2 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos vuz46)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];970 -> 1072[label="",style="solid", color="black", weight=3];
1066[label="vuz300",fontsize=16,color="green",shape="box"];1067[label="vuz300",fontsize=16,color="green",shape="box"];1068[label="vuz300",fontsize=16,color="green",shape="box"];1069[label="Integer (Neg vuz63) `quot` gcd2 (primEqInt (Neg (Succ vuz650)) (Pos Zero)) (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1069 -> 1129[label="",style="solid", color="black", weight=3];
1070[label="Integer (Neg vuz63) `quot` gcd2 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1070 -> 1130[label="",style="solid", color="black", weight=3];
971[label="vuz300",fontsize=16,color="green",shape="box"];972[label="vuz300",fontsize=16,color="green",shape="box"];1125[label="vuz300",fontsize=16,color="green",shape="box"];1126[label="vuz300",fontsize=16,color="green",shape="box"];1127[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg (Succ vuz820)) (Pos Zero)) (Integer (Neg vuz81)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1127 -> 1137[label="",style="solid", color="black", weight=3];
1128[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Neg vuz81)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1128 -> 1138[label="",style="solid", color="black", weight=3];
281 -> 829[label="",style="dashed", color="red", weight=0];
281[label="Integer (Pos (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];281 -> 850[label="",style="dashed", color="magenta", weight=3];
281 -> 851[label="",style="dashed", color="magenta", weight=3];
281 -> 852[label="",style="dashed", color="magenta", weight=3];
282 -> 989[label="",style="dashed", color="red", weight=0];
282[label="Integer (Neg (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];282 -> 1002[label="",style="dashed", color="magenta", weight=3];
282 -> 1003[label="",style="dashed", color="magenta", weight=3];
282 -> 1004[label="",style="dashed", color="magenta", weight=3];
283 -> 829[label="",style="dashed", color="red", weight=0];
283[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];283 -> 853[label="",style="dashed", color="magenta", weight=3];
283 -> 854[label="",style="dashed", color="magenta", weight=3];
283 -> 855[label="",style="dashed", color="magenta", weight=3];
284 -> 1083[label="",style="dashed", color="red", weight=0];
284[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];284 -> 1090[label="",style="dashed", color="magenta", weight=3];
284 -> 1091[label="",style="dashed", color="magenta", weight=3];
285[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];285 -> 307[label="",style="solid", color="black", weight=3];
286[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];286 -> 308[label="",style="solid", color="black", weight=3];
677[label="primMulNat (Succ vuz30000) (Succ Zero)",fontsize=16,color="black",shape="box"];677 -> 686[label="",style="solid", color="black", weight=3];
678[label="primMulNat Zero (Succ Zero)",fontsize=16,color="black",shape="box"];678 -> 687[label="",style="solid", color="black", weight=3];
1071[label="Integer (Pos vuz45) `quot` gcd2 False (Integer (Pos vuz46)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1071 -> 1131[label="",style="solid", color="black", weight=3];
1072[label="Integer (Pos vuz45) `quot` gcd2 True (Integer (Pos vuz46)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1072 -> 1132[label="",style="solid", color="black", weight=3];
1129[label="Integer (Neg vuz63) `quot` gcd2 False (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1129 -> 1139[label="",style="solid", color="black", weight=3];
1130[label="Integer (Neg vuz63) `quot` gcd2 True (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1130 -> 1140[label="",style="solid", color="black", weight=3];
1137[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 False (Integer (Neg vuz81)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1137 -> 1143[label="",style="solid", color="black", weight=3];
1138[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 True (Integer (Neg vuz81)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1138 -> 1144[label="",style="solid", color="black", weight=3];
850 -> 661[label="",style="dashed", color="red", weight=0];
850[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];850 -> 975[label="",style="dashed", color="magenta", weight=3];
851 -> 661[label="",style="dashed", color="red", weight=0];
851[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];851 -> 976[label="",style="dashed", color="magenta", weight=3];
852 -> 661[label="",style="dashed", color="red", weight=0];
852[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];852 -> 977[label="",style="dashed", color="magenta", weight=3];
1002 -> 661[label="",style="dashed", color="red", weight=0];
1002[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1002 -> 1075[label="",style="dashed", color="magenta", weight=3];
1003 -> 661[label="",style="dashed", color="red", weight=0];
1003[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1003 -> 1076[label="",style="dashed", color="magenta", weight=3];
1004 -> 661[label="",style="dashed", color="red", weight=0];
1004[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1004 -> 1077[label="",style="dashed", color="magenta", weight=3];
853 -> 661[label="",style="dashed", color="red", weight=0];
853[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];853 -> 978[label="",style="dashed", color="magenta", weight=3];
854[label="Succ vuz3100",fontsize=16,color="green",shape="box"];855 -> 661[label="",style="dashed", color="red", weight=0];
855[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];855 -> 979[label="",style="dashed", color="magenta", weight=3];
1090 -> 661[label="",style="dashed", color="red", weight=0];
1090[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1090 -> 1133[label="",style="dashed", color="magenta", weight=3];
1091 -> 661[label="",style="dashed", color="red", weight=0];
1091[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1091 -> 1134[label="",style="dashed", color="magenta", weight=3];
307[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];307 -> 329[label="",style="solid", color="black", weight=3];
308[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];308 -> 330[label="",style="solid", color="black", weight=3];
686 -> 710[label="",style="dashed", color="red", weight=0];
686[label="primPlusNat (primMulNat vuz30000 (Succ Zero)) (Succ Zero)",fontsize=16,color="magenta"];686 -> 711[label="",style="dashed", color="magenta", weight=3];
687[label="Zero",fontsize=16,color="green",shape="box"];1131[label="Integer (Pos vuz45) `quot` gcd0 (Integer (Pos vuz46)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];1131 -> 1141[label="",style="solid", color="black", weight=3];
1132[label="Integer (Pos vuz45) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos vuz46)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1132 -> 1142[label="",style="solid", color="black", weight=3];
1139[label="Integer (Neg vuz63) `quot` gcd0 (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];1139 -> 1145[label="",style="solid", color="black", weight=3];
1140[label="Integer (Neg vuz63) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1140 -> 1146[label="",style="solid", color="black", weight=3];
1143[label="Integer (Pos (Succ vuz3100)) `quot` gcd0 (Integer (Neg vuz81)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];1143 -> 1149[label="",style="solid", color="black", weight=3];
1144[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Neg vuz81)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1144 -> 1150[label="",style="solid", color="black", weight=3];
975[label="vuz300",fontsize=16,color="green",shape="box"];976[label="vuz300",fontsize=16,color="green",shape="box"];977[label="vuz300",fontsize=16,color="green",shape="box"];1075[label="vuz300",fontsize=16,color="green",shape="box"];1076[label="vuz300",fontsize=16,color="green",shape="box"];1077[label="vuz300",fontsize=16,color="green",shape="box"];978[label="vuz300",fontsize=16,color="green",shape="box"];979[label="vuz300",fontsize=16,color="green",shape="box"];1133[label="vuz300",fontsize=16,color="green",shape="box"];1134[label="vuz300",fontsize=16,color="green",shape="box"];329[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt vuz30 (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3400[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];329 -> 3400[label="",style="solid", color="burlywood", weight=9];
3400 -> 359[label="",style="solid", color="burlywood", weight=3];
3401[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];329 -> 3401[label="",style="solid", color="burlywood", weight=9];
3401 -> 360[label="",style="solid", color="burlywood", weight=3];
330[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt vuz30 (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3402[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];330 -> 3402[label="",style="solid", color="burlywood", weight=9];
3402 -> 361[label="",style="solid", color="burlywood", weight=3];
3403[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];330 -> 3403[label="",style="solid", color="burlywood", weight=9];
3403 -> 362[label="",style="solid", color="burlywood", weight=3];
711 -> 661[label="",style="dashed", color="red", weight=0];
711[label="primMulNat vuz30000 (Succ Zero)",fontsize=16,color="magenta"];711 -> 716[label="",style="dashed", color="magenta", weight=3];
710[label="primPlusNat vuz16 (Succ Zero)",fontsize=16,color="burlywood",shape="triangle"];3405[label="vuz16/Succ vuz160",fontsize=10,color="white",style="solid",shape="box"];710 -> 3405[label="",style="solid", color="burlywood", weight=9];
3405 -> 717[label="",style="solid", color="burlywood", weight=3];
3406[label="vuz16/Zero",fontsize=10,color="white",style="solid",shape="box"];710 -> 3406[label="",style="solid", color="burlywood", weight=9];
3406 -> 718[label="",style="solid", color="burlywood", weight=3];
1141[label="Integer (Pos vuz45) `quot` gcd0Gcd' (abs (Integer (Pos vuz46))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1141 -> 1147[label="",style="solid", color="black", weight=3];
1142[label="Integer (Pos vuz45) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Pos vuz46)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1142 -> 1148[label="",style="solid", color="black", weight=3];
1145[label="Integer (Neg vuz63) `quot` gcd0Gcd' (abs (Integer (Neg vuz64))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1145 -> 1151[label="",style="solid", color="black", weight=3];
1146[label="Integer (Neg vuz63) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1146 -> 1152[label="",style="solid", color="black", weight=3];
1149[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd' (abs (Integer (Neg vuz81))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1149 -> 1155[label="",style="solid", color="black", weight=3];
1150[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Neg vuz81)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1150 -> 1156[label="",style="solid", color="black", weight=3];
359[label="Integer (primMulInt (Pos vuz300) (Neg (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];359 -> 390[label="",style="solid", color="black", weight=3];
360[label="Integer (primMulInt (Neg vuz300) (Neg (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];360 -> 391[label="",style="solid", color="black", weight=3];
361[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];361 -> 392[label="",style="solid", color="black", weight=3];
362[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];362 -> 393[label="",style="solid", color="black", weight=3];
716[label="vuz30000",fontsize=16,color="green",shape="box"];717[label="primPlusNat (Succ vuz160) (Succ Zero)",fontsize=16,color="black",shape="box"];717 -> 774[label="",style="solid", color="black", weight=3];
718[label="primPlusNat Zero (Succ Zero)",fontsize=16,color="black",shape="box"];718 -> 775[label="",style="solid", color="black", weight=3];
1147[label="Integer (Pos vuz45) `quot` gcd0Gcd'2 (abs (Integer (Pos vuz46))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1147 -> 1153[label="",style="solid", color="black", weight=3];
1148[label="Integer (Pos vuz45) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Pos vuz46)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1148 -> 1154[label="",style="solid", color="black", weight=3];
1151[label="Integer (Neg vuz63) `quot` gcd0Gcd'2 (abs (Integer (Neg vuz64))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1151 -> 1157[label="",style="solid", color="black", weight=3];
1152[label="Integer (Neg vuz63) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1152 -> 1158[label="",style="solid", color="black", weight=3];
1155[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'2 (abs (Integer (Neg vuz81))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1155 -> 1161[label="",style="solid", color="black", weight=3];
1156[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Neg vuz81)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1156 -> 1162[label="",style="solid", color="black", weight=3];
390 -> 989[label="",style="dashed", color="red", weight=0];
390[label="Integer (Neg (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];390 -> 1032[label="",style="dashed", color="magenta", weight=3];
390 -> 1033[label="",style="dashed", color="magenta", weight=3];
390 -> 1034[label="",style="dashed", color="magenta", weight=3];
390 -> 1035[label="",style="dashed", color="magenta", weight=3];
391 -> 829[label="",style="dashed", color="red", weight=0];
391[label="Integer (Pos (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];391 -> 892[label="",style="dashed", color="magenta", weight=3];
391 -> 893[label="",style="dashed", color="magenta", weight=3];
391 -> 894[label="",style="dashed", color="magenta", weight=3];
391 -> 895[label="",style="dashed", color="magenta", weight=3];
392 -> 1083[label="",style="dashed", color="red", weight=0];
392[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];392 -> 1100[label="",style="dashed", color="magenta", weight=3];
392 -> 1101[label="",style="dashed", color="magenta", weight=3];
392 -> 1102[label="",style="dashed", color="magenta", weight=3];
393 -> 829[label="",style="dashed", color="red", weight=0];
393[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];393 -> 896[label="",style="dashed", color="magenta", weight=3];
393 -> 897[label="",style="dashed", color="magenta", weight=3];
393 -> 898[label="",style="dashed", color="magenta", weight=3];
393 -> 899[label="",style="dashed", color="magenta", weight=3];
774[label="Succ (Succ (primPlusNat vuz160 Zero))",fontsize=16,color="green",shape="box"];774 -> 827[label="",style="dashed", color="green", weight=3];
775[label="Succ Zero",fontsize=16,color="green",shape="box"];1153[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1153 -> 1159[label="",style="solid", color="black", weight=3];
1154[label="Integer (Pos vuz45) `quot` gcd1 False (Integer (Pos vuz46)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1154 -> 1160[label="",style="solid", color="black", weight=3];
1157[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1157 -> 1163[label="",style="solid", color="black", weight=3];
1158[label="Integer (Neg vuz63) `quot` gcd1 False (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1158 -> 1164[label="",style="solid", color="black", weight=3];
1161[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1161 -> 1166[label="",style="solid", color="black", weight=3];
1162[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 False (Integer (Neg vuz81)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1162 -> 1167[label="",style="solid", color="black", weight=3];
1032[label="vuz3100",fontsize=16,color="green",shape="box"];1033 -> 661[label="",style="dashed", color="red", weight=0];
1033[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1033 -> 1078[label="",style="dashed", color="magenta", weight=3];
1034 -> 661[label="",style="dashed", color="red", weight=0];
1034[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1034 -> 1079[label="",style="dashed", color="magenta", weight=3];
1035 -> 661[label="",style="dashed", color="red", weight=0];
1035[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1035 -> 1080[label="",style="dashed", color="magenta", weight=3];
892[label="vuz3100",fontsize=16,color="green",shape="box"];893 -> 661[label="",style="dashed", color="red", weight=0];
893[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];893 -> 981[label="",style="dashed", color="magenta", weight=3];
894 -> 661[label="",style="dashed", color="red", weight=0];
894[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];894 -> 982[label="",style="dashed", color="magenta", weight=3];
895 -> 661[label="",style="dashed", color="red", weight=0];
895[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];895 -> 983[label="",style="dashed", color="magenta", weight=3];
1100[label="vuz3100",fontsize=16,color="green",shape="box"];1101 -> 661[label="",style="dashed", color="red", weight=0];
1101[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1101 -> 1135[label="",style="dashed", color="magenta", weight=3];
1102 -> 661[label="",style="dashed", color="red", weight=0];
1102[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];1102 -> 1136[label="",style="dashed", color="magenta", weight=3];
896[label="vuz3100",fontsize=16,color="green",shape="box"];897 -> 661[label="",style="dashed", color="red", weight=0];
897[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];897 -> 984[label="",style="dashed", color="magenta", weight=3];
898[label="Succ vuz3100",fontsize=16,color="green",shape="box"];899 -> 661[label="",style="dashed", color="red", weight=0];
899[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];899 -> 985[label="",style="dashed", color="magenta", weight=3];
827[label="primPlusNat vuz160 Zero",fontsize=16,color="burlywood",shape="box"];3421[label="vuz160/Succ vuz1600",fontsize=10,color="white",style="solid",shape="box"];827 -> 3421[label="",style="solid", color="burlywood", weight=9];
3421 -> 986[label="",style="solid", color="burlywood", weight=3];
3422[label="vuz160/Zero",fontsize=10,color="white",style="solid",shape="box"];827 -> 3422[label="",style="solid", color="burlywood", weight=9];
3422 -> 987[label="",style="solid", color="burlywood", weight=3];
1159[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (absReal (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1159 -> 1165[label="",style="solid", color="black", weight=3];
1160 -> 1131[label="",style="dashed", color="red", weight=0];
1160[label="Integer (Pos vuz45) `quot` gcd0 (Integer (Pos vuz46)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];1163[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1163 -> 1168[label="",style="solid", color="black", weight=3];
1164 -> 1139[label="",style="dashed", color="red", weight=0];
1164[label="Integer (Neg vuz63) `quot` gcd0 (Integer (Neg vuz64)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];1166[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (absReal (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1166 -> 1170[label="",style="solid", color="black", weight=3];
1167 -> 1143[label="",style="dashed", color="red", weight=0];
1167[label="Integer (Pos (Succ vuz3100)) `quot` gcd0 (Integer (Neg vuz81)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];1078[label="vuz300",fontsize=16,color="green",shape="box"];1079[label="vuz300",fontsize=16,color="green",shape="box"];1080[label="vuz300",fontsize=16,color="green",shape="box"];981[label="vuz300",fontsize=16,color="green",shape="box"];982[label="vuz300",fontsize=16,color="green",shape="box"];983[label="vuz300",fontsize=16,color="green",shape="box"];1135[label="vuz300",fontsize=16,color="green",shape="box"];1136[label="vuz300",fontsize=16,color="green",shape="box"];984[label="vuz300",fontsize=16,color="green",shape="box"];985[label="vuz300",fontsize=16,color="green",shape="box"];986[label="primPlusNat (Succ vuz1600) Zero",fontsize=16,color="black",shape="box"];986 -> 1081[label="",style="solid", color="black", weight=3];
987[label="primPlusNat Zero Zero",fontsize=16,color="black",shape="box"];987 -> 1082[label="",style="solid", color="black", weight=3];
1165[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (absReal2 (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1165 -> 1169[label="",style="solid", color="black", weight=3];
1168[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal2 (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1168 -> 1171[label="",style="solid", color="black", weight=3];
1170[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (absReal2 (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1170 -> 1173[label="",style="solid", color="black", weight=3];
1081[label="Succ vuz1600",fontsize=16,color="green",shape="box"];1082[label="Zero",fontsize=16,color="green",shape="box"];1169[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];1169 -> 1172[label="",style="solid", color="black", weight=3];
1171[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];1171 -> 1174[label="",style="solid", color="black", weight=3];
1173[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];1173 -> 1176[label="",style="solid", color="black", weight=3];
1172[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];1172 -> 1175[label="",style="solid", color="black", weight=3];
1174[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];1174 -> 1177[label="",style="solid", color="black", weight=3];
1176[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];1176 -> 1179[label="",style="solid", color="black", weight=3];
1175[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];1175 -> 1178[label="",style="solid", color="black", weight=3];
1177[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];1177 -> 1180[label="",style="solid", color="black", weight=3];
1179[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];1179 -> 1182[label="",style="solid", color="black", weight=3];
1178[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];1178 -> 1181[label="",style="solid", color="black", weight=3];
1180[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];1180 -> 1183[label="",style="solid", color="black", weight=3];
1182[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];1182 -> 1185[label="",style="solid", color="black", weight=3];
1181[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];1181 -> 1184[label="",style="solid", color="black", weight=3];
1183[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];1183 -> 1186[label="",style="solid", color="black", weight=3];
1185[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];1185 -> 1188[label="",style="solid", color="black", weight=3];
1184[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)))",fontsize=16,color="black",shape="box"];1184 -> 1187[label="",style="solid", color="black", weight=3];
1186[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)))",fontsize=16,color="black",shape="box"];1186 -> 1189[label="",style="solid", color="black", weight=3];
1188[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)))",fontsize=16,color="black",shape="box"];1188 -> 1191[label="",style="solid", color="black", weight=3];
1187[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];1187 -> 1190[label="",style="solid", color="black", weight=3];
1189[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];1189 -> 1192[label="",style="solid", color="black", weight=3];
1191[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];1191 -> 1194[label="",style="solid", color="black", weight=3];
1190[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False))",fontsize=16,color="black",shape="box"];1190 -> 1193[label="",style="solid", color="black", weight=3];
1192[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False))",fontsize=16,color="black",shape="box"];1192 -> 1195[label="",style="solid", color="black", weight=3];
1194[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False))",fontsize=16,color="black",shape="box"];1194 -> 1197[label="",style="solid", color="black", weight=3];
1193[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (absReal1 (Integer (Pos (Succ vuz3100))) True)",fontsize=16,color="black",shape="box"];1193 -> 1196[label="",style="solid", color="black", weight=3];
1195[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (absReal1 (Integer (Pos (Succ vuz3100))) True)",fontsize=16,color="black",shape="box"];1195 -> 1198[label="",style="solid", color="black", weight=3];
1197[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (absReal1 (Integer (Pos (Succ vuz3100))) True)",fontsize=16,color="black",shape="box"];1197 -> 1200[label="",style="solid", color="black", weight=3];
1196[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz46))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1196 -> 1199[label="",style="solid", color="black", weight=3];
1198[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz64))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1198 -> 1201[label="",style="solid", color="black", weight=3];
1200[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz81))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1200 -> 1203[label="",style="solid", color="black", weight=3];
1199[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (abs (Integer (Pos vuz46))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1199 -> 1202[label="",style="solid", color="black", weight=3];
1201[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (abs (Integer (Neg vuz64))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1201 -> 1204[label="",style="solid", color="black", weight=3];
1203[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (abs (Integer (Neg vuz81))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1203 -> 1206[label="",style="solid", color="black", weight=3];
1202[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (abs (Integer (Pos vuz46))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1202 -> 1205[label="",style="solid", color="black", weight=3];
1204[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (abs (Integer (Neg vuz64))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1204 -> 1207[label="",style="solid", color="black", weight=3];
1206[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (abs (Integer (Neg vuz81))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1206 -> 1209[label="",style="solid", color="black", weight=3];
1205[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 False (abs (Integer (Pos vuz46))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1205 -> 1208[label="",style="solid", color="black", weight=3];
1207[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 False (abs (Integer (Neg vuz64))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1207 -> 1210[label="",style="solid", color="black", weight=3];
1209[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 False (abs (Integer (Neg vuz81))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1209 -> 1212[label="",style="solid", color="black", weight=3];
1208[label="Integer (Pos vuz45) `quot` gcd0Gcd'0 (abs (Integer (Pos vuz46))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1208 -> 1211[label="",style="solid", color="black", weight=3];
1210[label="Integer (Neg vuz63) `quot` gcd0Gcd'0 (abs (Integer (Neg vuz64))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1210 -> 1213[label="",style="solid", color="black", weight=3];
1212[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'0 (abs (Integer (Neg vuz81))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1212 -> 1215[label="",style="solid", color="black", weight=3];
1211[label="Integer (Pos vuz45) `quot` gcd0Gcd' (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos vuz46)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1211 -> 1214[label="",style="solid", color="black", weight=3];
1213[label="Integer (Neg vuz63) `quot` gcd0Gcd' (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1213 -> 1216[label="",style="solid", color="black", weight=3];
1215[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd' (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz81)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1215 -> 1218[label="",style="solid", color="black", weight=3];
1214[label="Integer (Pos vuz45) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos vuz46)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1214 -> 1217[label="",style="solid", color="black", weight=3];
1216[label="Integer (Neg vuz63) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1216 -> 1219[label="",style="solid", color="black", weight=3];
1218[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz81)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1218 -> 1221[label="",style="solid", color="black", weight=3];
1217[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (abs (Integer (Pos vuz46)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos vuz46)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1217 -> 1220[label="",style="solid", color="black", weight=3];
1219[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (abs (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1219 -> 1222[label="",style="solid", color="black", weight=3];
1221[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (abs (Integer (Neg vuz81)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz81)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1221 -> 1224[label="",style="solid", color="black", weight=3];
1220[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal (Integer (Pos vuz46)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal (Integer (Pos vuz46)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1220 -> 1223[label="",style="solid", color="black", weight=3];
1222[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1222 -> 1225[label="",style="solid", color="black", weight=3];
1224[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal (Integer (Neg vuz81)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal (Integer (Neg vuz81)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1224 -> 1227[label="",style="solid", color="black", weight=3];
1223[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos vuz46)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal2 (Integer (Pos vuz46)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1223 -> 1226[label="",style="solid", color="black", weight=3];
1225[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal2 (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal2 (Integer (Neg vuz64)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1225 -> 1228[label="",style="solid", color="black", weight=3];
1227[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal2 (Integer (Neg vuz81)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal2 (Integer (Neg vuz81)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1227 -> 1230[label="",style="solid", color="black", weight=3];
1226[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz46)) (Integer (Pos vuz46) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz46)) (Integer (Pos vuz46) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1226 -> 1229[label="",style="solid", color="black", weight=3];
1228[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz64)) (Integer (Neg vuz64) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz64)) (Integer (Neg vuz64) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1228 -> 1231[label="",style="solid", color="black", weight=3];
1230[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz81)) (Integer (Neg vuz81) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz81)) (Integer (Neg vuz81) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1230 -> 1233[label="",style="solid", color="black", weight=3];
1229[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz46)) (compare (Integer (Pos vuz46)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz46)) (compare (Integer (Pos vuz46)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1229 -> 1232[label="",style="solid", color="black", weight=3];
1231[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz64)) (compare (Integer (Neg vuz64)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz64)) (compare (Integer (Neg vuz64)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1231 -> 1234[label="",style="solid", color="black", weight=3];
1233[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz81)) (compare (Integer (Neg vuz81)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz81)) (compare (Integer (Neg vuz81)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1233 -> 1236[label="",style="solid", color="black", weight=3];
1232[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz46)) (not (compare (Integer (Pos vuz46)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz46)) (not (compare (Integer (Pos vuz46)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1232 -> 1235[label="",style="solid", color="black", weight=3];
1234[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz64)) (not (compare (Integer (Neg vuz64)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz64)) (not (compare (Integer (Neg vuz64)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1234 -> 1237[label="",style="solid", color="black", weight=3];
1236[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz81)) (not (compare (Integer (Neg vuz81)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz81)) (not (compare (Integer (Neg vuz81)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1236 -> 1239[label="",style="solid", color="black", weight=3];
1235[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz46)) (not (compare (Integer (Pos vuz46)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz46)) (not (compare (Integer (Pos vuz46)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1235 -> 1238[label="",style="solid", color="black", weight=3];
1237[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz64)) (not (compare (Integer (Neg vuz64)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz64)) (not (compare (Integer (Neg vuz64)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1237 -> 1240[label="",style="solid", color="black", weight=3];
1239[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz81)) (not (compare (Integer (Neg vuz81)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz81)) (not (compare (Integer (Neg vuz81)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1239 -> 1243[label="",style="solid", color="black", weight=3];
1238[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz46)) (not (primCmpInt (Pos vuz46) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz46)) (not (primCmpInt (Pos vuz46) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3426[label="vuz46/Succ vuz460",fontsize=10,color="white",style="solid",shape="box"];1238 -> 3426[label="",style="solid", color="burlywood", weight=9];
3426 -> 1241[label="",style="solid", color="burlywood", weight=3];
3427[label="vuz46/Zero",fontsize=10,color="white",style="solid",shape="box"];1238 -> 3427[label="",style="solid", color="burlywood", weight=9];
3427 -> 1242[label="",style="solid", color="burlywood", weight=3];
1240[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz64)) (not (primCmpInt (Neg vuz64) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz64)) (not (primCmpInt (Neg vuz64) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3428[label="vuz64/Succ vuz640",fontsize=10,color="white",style="solid",shape="box"];1240 -> 3428[label="",style="solid", color="burlywood", weight=9];
3428 -> 1244[label="",style="solid", color="burlywood", weight=3];
3429[label="vuz64/Zero",fontsize=10,color="white",style="solid",shape="box"];1240 -> 3429[label="",style="solid", color="burlywood", weight=9];
3429 -> 1245[label="",style="solid", color="burlywood", weight=3];
1243[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz81)) (not (primCmpInt (Neg vuz81) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz81)) (not (primCmpInt (Neg vuz81) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];3430[label="vuz81/Succ vuz810",fontsize=10,color="white",style="solid",shape="box"];1243 -> 3430[label="",style="solid", color="burlywood", weight=9];
3430 -> 1248[label="",style="solid", color="burlywood", weight=3];
3431[label="vuz81/Zero",fontsize=10,color="white",style="solid",shape="box"];1243 -> 3431[label="",style="solid", color="burlywood", weight=9];
3431 -> 1249[label="",style="solid", color="burlywood", weight=3];
1241[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz460))) (not (primCmpInt (Pos (Succ vuz460)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz460))) (not (primCmpInt (Pos (Succ vuz460)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1241 -> 1246[label="",style="solid", color="black", weight=3];
1242[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1242 -> 1247[label="",style="solid", color="black", weight=3];
1244[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz640))) (not (primCmpInt (Neg (Succ vuz640)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz640))) (not (primCmpInt (Neg (Succ vuz640)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1244 -> 1250[label="",style="solid", color="black", weight=3];
1245[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1245 -> 1251[label="",style="solid", color="black", weight=3];
1248[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz810))) (not (primCmpInt (Neg (Succ vuz810)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz810))) (not (primCmpInt (Neg (Succ vuz810)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1248 -> 1254[label="",style="solid", color="black", weight=3];
1249[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1249 -> 1255[label="",style="solid", color="black", weight=3];
1246[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz460))) (not (primCmpNat (Succ vuz460) Zero == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz460))) (not (primCmpNat (Succ vuz460) Zero == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1246 -> 1252[label="",style="solid", color="black", weight=3];
1247[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1247 -> 1253[label="",style="solid", color="black", weight=3];
1250[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz640))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz640))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1250 -> 1256[label="",style="solid", color="black", weight=3];
1251[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1251 -> 1257[label="",style="solid", color="black", weight=3];
1254[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz810))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz810))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1254 -> 1260[label="",style="solid", color="black", weight=3];
1255[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1255 -> 1261[label="",style="solid", color="black", weight=3];
1252[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz460))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz460))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1252 -> 1258[label="",style="solid", color="black", weight=3];
1253[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1253 -> 1259[label="",style="solid", color="black", weight=3];
1256[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz640))) (not True) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz640))) (not True) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1256 -> 1262[label="",style="solid", color="black", weight=3];
1257[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1257 -> 1263[label="",style="solid", color="black", weight=3];
1260[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz810))) (not True) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz810))) (not True) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1260 -> 1266[label="",style="solid", color="black", weight=3];
1261[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1261 -> 1267[label="",style="solid", color="black", weight=3];
1258[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz460))) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz460))) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1258 -> 1264[label="",style="solid", color="black", weight=3];
1259[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1259 -> 1265[label="",style="solid", color="black", weight=3];
1262[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz640))) False `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz640))) False `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1262 -> 1268[label="",style="solid", color="black", weight=3];
1263[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1263 -> 1269[label="",style="solid", color="black", weight=3];
1266[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz810))) False `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz810))) False `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1266 -> 1272[label="",style="solid", color="black", weight=3];
1267[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1267 -> 1273[label="",style="solid", color="black", weight=3];
1264[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz460))) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz460))) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1264 -> 1270[label="",style="solid", color="black", weight=3];
1265[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (Integer (Pos Zero) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1265 -> 1271[label="",style="solid", color="black", weight=3];
1268[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz640))) otherwise `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal0 (Integer (Neg (Succ vuz640))) otherwise `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1268 -> 1274[label="",style="solid", color="black", weight=3];
1269[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1269 -> 1275[label="",style="solid", color="black", weight=3];
1272[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz810))) otherwise `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal0 (Integer (Neg (Succ vuz810))) otherwise `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1272 -> 1278[label="",style="solid", color="black", weight=3];
1273[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1273 -> 1279[label="",style="solid", color="black", weight=3];
1270[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz460)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz460)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];1270 -> 1276[label="",style="solid", color="black", weight=3];
1271[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1271 -> 1277[label="",style="solid", color="black", weight=3];
1274[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz640))) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal0 (Integer (Neg (Succ vuz640))) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1274 -> 1280[label="",style="solid", color="black", weight=3];
1275[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1275 -> 1281[label="",style="solid", color="black", weight=3];
1278[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz810))) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal0 (Integer (Neg (Succ vuz810))) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1278 -> 1284[label="",style="solid", color="black", weight=3];
1279[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1279 -> 1285[label="",style="solid", color="black", weight=3];
1276[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz460)) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz460)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1276 -> 1282[label="",style="solid", color="black", weight=3];
1277[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1277 -> 1283[label="",style="solid", color="black", weight=3];
1280[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 ((`negate` Integer (Neg (Succ vuz640))) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) ((`negate` Integer (Neg (Succ vuz640))) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1280 -> 1286[label="",style="solid", color="black", weight=3];
1281[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1281 -> 1287[label="",style="solid", color="black", weight=3];
1284[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 ((`negate` Integer (Neg (Succ vuz810))) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) ((`negate` Integer (Neg (Succ vuz810))) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1284 -> 1290[label="",style="solid", color="black", weight=3];
1285[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1285 -> 1291[label="",style="solid", color="black", weight=3];
1282[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz460)) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz460)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1282 -> 1288[label="",style="solid", color="black", weight=3];
1283[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos Zero) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1283 -> 1289[label="",style="solid", color="black", weight=3];
1286[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (Integer (primNegInt (Neg (Succ vuz640))) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primNegInt (Neg (Succ vuz640))) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1286 -> 1292[label="",style="solid", color="black", weight=3];
1287[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Neg Zero) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1287 -> 1293[label="",style="solid", color="black", weight=3];
1290[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primNegInt (Neg (Succ vuz810))) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primNegInt (Neg (Succ vuz810))) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];1290 -> 1296[label="",style="solid", color="black", weight=3];
1291[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Neg Zero) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1291 -> 1297[label="",style="solid", color="black", weight=3];
1288[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz460)) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz460)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="triangle"];1288 -> 1294[label="",style="solid", color="black", weight=3];
1289 -> 2309[label="",style="dashed", color="red", weight=0];
1289[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS Zero (Succ vuz3100))))",fontsize=16,color="magenta"];1289 -> 2310[label="",style="dashed", color="magenta", weight=3];
1289 -> 2311[label="",style="dashed", color="magenta", weight=3];
1289 -> 2312[label="",style="dashed", color="magenta", weight=3];
1289 -> 2313[label="",style="dashed", color="magenta", weight=3];
1292[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz640))) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz640))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1292 -> 1298[label="",style="solid", color="black", weight=3];
1293[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (primEqInt (Neg (primModNatS Zero (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg (primModNatS Zero (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1293 -> 1299[label="",style="solid", color="black", weight=3];
1296[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz810))) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz810))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1296 -> 1302[label="",style="solid", color="black", weight=3];
1297[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Neg (primModNatS Zero (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg (primModNatS Zero (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1297 -> 1303[label="",style="solid", color="black", weight=3];
1294 -> 2309[label="",style="dashed", color="red", weight=0];
1294[label="Integer (Pos vuz45) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz460) (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS (Succ vuz460) (Succ vuz3100))))",fontsize=16,color="magenta"];1294 -> 2314[label="",style="dashed", color="magenta", weight=3];
1294 -> 2315[label="",style="dashed", color="magenta", weight=3];
1294 -> 2316[label="",style="dashed", color="magenta", weight=3];
1294 -> 2317[label="",style="dashed", color="magenta", weight=3];
2310[label="Zero",fontsize=16,color="green",shape="box"];2311[label="Zero",fontsize=16,color="green",shape="box"];2312[label="vuz3100",fontsize=16,color="green",shape="box"];2313[label="vuz45",fontsize=16,color="green",shape="box"];2309[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS vuz158 (Succ vuz148))) (Pos Zero)) (Integer (Pos (Succ vuz148))) (Integer (Pos (primModNatS vuz157 (Succ vuz148))))",fontsize=16,color="burlywood",shape="triangle"];3434[label="vuz158/Succ vuz1580",fontsize=10,color="white",style="solid",shape="box"];2309 -> 3434[label="",style="solid", color="burlywood", weight=9];
3434 -> 2336[label="",style="solid", color="burlywood", weight=3];
3435[label="vuz158/Zero",fontsize=10,color="white",style="solid",shape="box"];2309 -> 3435[label="",style="solid", color="burlywood", weight=9];
3435 -> 2337[label="",style="solid", color="burlywood", weight=3];
1298[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz640))) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz640))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1298 -> 1304[label="",style="solid", color="black", weight=3];
1299[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];1299 -> 1305[label="",style="solid", color="black", weight=3];
1302[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz810))) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz810))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1302 -> 1309[label="",style="solid", color="black", weight=3];
1303[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];1303 -> 1310[label="",style="solid", color="black", weight=3];
2314[label="Succ vuz460",fontsize=16,color="green",shape="box"];2315[label="Succ vuz460",fontsize=16,color="green",shape="box"];2316[label="vuz3100",fontsize=16,color="green",shape="box"];2317[label="vuz45",fontsize=16,color="green",shape="box"];2336[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz1580) (Succ vuz148))) (Pos Zero)) (Integer (Pos (Succ vuz148))) (Integer (Pos (primModNatS vuz157 (Succ vuz148))))",fontsize=16,color="black",shape="box"];2336 -> 2353[label="",style="solid", color="black", weight=3];
2337[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ vuz148))) (Pos Zero)) (Integer (Pos (Succ vuz148))) (Integer (Pos (primModNatS vuz157 (Succ vuz148))))",fontsize=16,color="black",shape="box"];2337 -> 2354[label="",style="solid", color="black", weight=3];
1304[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (primEqInt (primRemInt (primNegInt (Neg (Succ vuz640))) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz640))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1304 -> 1311[label="",style="solid", color="black", weight=3];
1305[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];1305 -> 1312[label="",style="solid", color="black", weight=3];
1309[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (primNegInt (Neg (Succ vuz810))) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz810))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];1309 -> 1318[label="",style="solid", color="black", weight=3];
1310[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];1310 -> 1319[label="",style="solid", color="black", weight=3];
2353[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz1580 vuz148 (primGEqNatS vuz1580 vuz148))) (Pos Zero)) (Integer (Pos (Succ vuz148))) (Integer (Pos (primModNatS0 vuz1580 vuz148 (primGEqNatS vuz1580 vuz148))))",fontsize=16,color="burlywood",shape="box"];3436[label="vuz1580/Succ vuz15800",fontsize=10,color="white",style="solid",shape="box"];2353 -> 3436[label="",style="solid", color="burlywood", weight=9];
3436 -> 2411[label="",style="solid", color="burlywood", weight=3];
3437[label="vuz1580/Zero",fontsize=10,color="white",style="solid",shape="box"];2353 -> 3437[label="",style="solid", color="burlywood", weight=9];
3437 -> 2412[label="",style="solid", color="burlywood", weight=3];
2354[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ vuz148))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2354 -> 2413[label="",style="solid", color="black", weight=3];
1311[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz640)) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz640)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="triangle"];1311 -> 1320[label="",style="solid", color="black", weight=3];
1312[label="Integer (Neg vuz63) `quot` Integer (Pos (Succ vuz3100))",fontsize=16,color="black",shape="triangle"];1312 -> 1321[label="",style="solid", color="black", weight=3];
1318 -> 1288[label="",style="dashed", color="red", weight=0];
1318[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz810)) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz810)) (Pos (Succ vuz3100))))",fontsize=16,color="magenta"];1318 -> 1327[label="",style="dashed", color="magenta", weight=3];
1318 -> 1328[label="",style="dashed", color="magenta", weight=3];
1319 -> 1308[label="",style="dashed", color="red", weight=0];
1319[label="Integer (Pos (Succ vuz3100)) `quot` Integer (Pos (Succ vuz3100))",fontsize=16,color="magenta"];1319 -> 1329[label="",style="dashed", color="magenta", weight=3];
2411[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz15800) vuz148 (primGEqNatS (Succ vuz15800) vuz148))) (Pos Zero)) (Integer (Pos (Succ vuz148))) (Integer (Pos (primModNatS0 (Succ vuz15800) vuz148 (primGEqNatS (Succ vuz15800) vuz148))))",fontsize=16,color="burlywood",shape="box"];3440[label="vuz148/Succ vuz1480",fontsize=10,color="white",style="solid",shape="box"];2411 -> 3440[label="",style="solid", color="burlywood", weight=9];
3440 -> 2421[label="",style="solid", color="burlywood", weight=3];
3441[label="vuz148/Zero",fontsize=10,color="white",style="solid",shape="box"];2411 -> 3441[label="",style="solid", color="burlywood", weight=9];
3441 -> 2422[label="",style="solid", color="burlywood", weight=3];
2412[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz148 (primGEqNatS Zero vuz148))) (Pos Zero)) (Integer (Pos (Succ vuz148))) (Integer (Pos (primModNatS0 Zero vuz148 (primGEqNatS Zero vuz148))))",fontsize=16,color="burlywood",shape="box"];3442[label="vuz148/Succ vuz1480",fontsize=10,color="white",style="solid",shape="box"];2412 -> 3442[label="",style="solid", color="burlywood", weight=9];
3442 -> 2423[label="",style="solid", color="burlywood", weight=3];
3443[label="vuz148/Zero",fontsize=10,color="white",style="solid",shape="box"];2412 -> 3443[label="",style="solid", color="burlywood", weight=9];
3443 -> 2424[label="",style="solid", color="burlywood", weight=3];
2413[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz148))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2413 -> 2425[label="",style="solid", color="black", weight=3];
1320 -> 2477[label="",style="dashed", color="red", weight=0];
1320[label="Integer (Neg vuz63) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz640) (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS (Succ vuz640) (Succ vuz3100))))",fontsize=16,color="magenta"];1320 -> 2478[label="",style="dashed", color="magenta", weight=3];
1320 -> 2479[label="",style="dashed", color="magenta", weight=3];
1320 -> 2480[label="",style="dashed", color="magenta", weight=3];
1320 -> 2481[label="",style="dashed", color="magenta", weight=3];
1321[label="Integer (primQuotInt (Neg vuz63) (Pos (Succ vuz3100)))",fontsize=16,color="green",shape="box"];1321 -> 1331[label="",style="dashed", color="green", weight=3];
1327[label="vuz810",fontsize=16,color="green",shape="box"];1328[label="Succ vuz3100",fontsize=16,color="green",shape="box"];1329[label="Succ vuz3100",fontsize=16,color="green",shape="box"];1308[label="Integer (Pos vuz45) `quot` Integer (Pos (Succ vuz3100))",fontsize=16,color="black",shape="triangle"];1308 -> 1317[label="",style="solid", color="black", weight=3];
2421[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz15800) (Succ vuz1480) (primGEqNatS (Succ vuz15800) (Succ vuz1480)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1480)))) (Integer (Pos (primModNatS0 (Succ vuz15800) (Succ vuz1480) (primGEqNatS (Succ vuz15800) (Succ vuz1480)))))",fontsize=16,color="black",shape="box"];2421 -> 2432[label="",style="solid", color="black", weight=3];
2422[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz15800) Zero (primGEqNatS (Succ vuz15800) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz15800) Zero (primGEqNatS (Succ vuz15800) Zero))))",fontsize=16,color="black",shape="box"];2422 -> 2433[label="",style="solid", color="black", weight=3];
2423[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1480) (primGEqNatS Zero (Succ vuz1480)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1480)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1480) (primGEqNatS Zero (Succ vuz1480)))))",fontsize=16,color="black",shape="box"];2423 -> 2434[label="",style="solid", color="black", weight=3];
2424[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];2424 -> 2435[label="",style="solid", color="black", weight=3];
2425 -> 1308[label="",style="dashed", color="red", weight=0];
2425[label="Integer (Pos vuz146) `quot` Integer (Pos (Succ vuz148))",fontsize=16,color="magenta"];2425 -> 2436[label="",style="dashed", color="magenta", weight=3];
2425 -> 2437[label="",style="dashed", color="magenta", weight=3];
2478[label="Succ vuz640",fontsize=16,color="green",shape="box"];2479[label="vuz63",fontsize=16,color="green",shape="box"];2480[label="vuz3100",fontsize=16,color="green",shape="box"];2481[label="Succ vuz640",fontsize=16,color="green",shape="box"];2477[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS vuz170 (Succ vuz162))) (Pos Zero)) (Integer (Pos (Succ vuz162))) (Integer (Pos (primModNatS vuz169 (Succ vuz162))))",fontsize=16,color="burlywood",shape="triangle"];3446[label="vuz170/Succ vuz1700",fontsize=10,color="white",style="solid",shape="box"];2477 -> 3446[label="",style="solid", color="burlywood", weight=9];
3446 -> 2500[label="",style="solid", color="burlywood", weight=3];
3447[label="vuz170/Zero",fontsize=10,color="white",style="solid",shape="box"];2477 -> 3447[label="",style="solid", color="burlywood", weight=9];
3447 -> 2501[label="",style="solid", color="burlywood", weight=3];
1331[label="primQuotInt (Neg vuz63) (Pos (Succ vuz3100))",fontsize=16,color="black",shape="box"];1331 -> 1340[label="",style="solid", color="black", weight=3];
1317[label="Integer (primQuotInt (Pos vuz45) (Pos (Succ vuz3100)))",fontsize=16,color="green",shape="box"];1317 -> 1326[label="",style="dashed", color="green", weight=3];
2432 -> 3110[label="",style="dashed", color="red", weight=0];
2432[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz15800) (Succ vuz1480) (primGEqNatS vuz15800 vuz1480))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1480)))) (Integer (Pos (primModNatS0 (Succ vuz15800) (Succ vuz1480) (primGEqNatS vuz15800 vuz1480))))",fontsize=16,color="magenta"];2432 -> 3111[label="",style="dashed", color="magenta", weight=3];
2432 -> 3112[label="",style="dashed", color="magenta", weight=3];
2432 -> 3113[label="",style="dashed", color="magenta", weight=3];
2432 -> 3114[label="",style="dashed", color="magenta", weight=3];
2432 -> 3115[label="",style="dashed", color="magenta", weight=3];
2433[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz15800) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz15800) Zero True)))",fontsize=16,color="black",shape="box"];2433 -> 2452[label="",style="solid", color="black", weight=3];
2434[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1480) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1480)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1480) False)))",fontsize=16,color="black",shape="box"];2434 -> 2453[label="",style="solid", color="black", weight=3];
2435[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="black",shape="box"];2435 -> 2454[label="",style="solid", color="black", weight=3];
2436[label="vuz148",fontsize=16,color="green",shape="box"];2437[label="vuz146",fontsize=16,color="green",shape="box"];2500[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz1700) (Succ vuz162))) (Pos Zero)) (Integer (Pos (Succ vuz162))) (Integer (Pos (primModNatS vuz169 (Succ vuz162))))",fontsize=16,color="black",shape="box"];2500 -> 2519[label="",style="solid", color="black", weight=3];
2501[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ vuz162))) (Pos Zero)) (Integer (Pos (Succ vuz162))) (Integer (Pos (primModNatS vuz169 (Succ vuz162))))",fontsize=16,color="black",shape="box"];2501 -> 2520[label="",style="solid", color="black", weight=3];
1340[label="Neg (primDivNatS vuz63 (Succ vuz3100))",fontsize=16,color="green",shape="box"];1340 -> 1353[label="",style="dashed", color="green", weight=3];
1326[label="primQuotInt (Pos vuz45) (Pos (Succ vuz3100))",fontsize=16,color="black",shape="box"];1326 -> 1337[label="",style="solid", color="black", weight=3];
3111[label="vuz1480",fontsize=16,color="green",shape="box"];3112[label="vuz146",fontsize=16,color="green",shape="box"];3113[label="vuz15800",fontsize=16,color="green",shape="box"];3114[label="vuz15800",fontsize=16,color="green",shape="box"];3115[label="Succ vuz1480",fontsize=16,color="green",shape="box"];3110[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS vuz202 vuz203))) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS vuz202 vuz203))))",fontsize=16,color="burlywood",shape="triangle"];3449[label="vuz202/Succ vuz2020",fontsize=10,color="white",style="solid",shape="box"];3110 -> 3449[label="",style="solid", color="burlywood", weight=9];
3449 -> 3161[label="",style="solid", color="burlywood", weight=3];
3450[label="vuz202/Zero",fontsize=10,color="white",style="solid",shape="box"];3110 -> 3450[label="",style="solid", color="burlywood", weight=9];
3450 -> 3162[label="",style="solid", color="burlywood", weight=3];
2452 -> 2309[label="",style="dashed", color="red", weight=0];
2452[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz15800) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz15800) Zero) (Succ Zero))))",fontsize=16,color="magenta"];2452 -> 2470[label="",style="dashed", color="magenta", weight=3];
2452 -> 2471[label="",style="dashed", color="magenta", weight=3];
2452 -> 2472[label="",style="dashed", color="magenta", weight=3];
2453[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1480)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2453 -> 2473[label="",style="solid", color="black", weight=3];
2454 -> 2309[label="",style="dashed", color="red", weight=0];
2454[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))))",fontsize=16,color="magenta"];2454 -> 2474[label="",style="dashed", color="magenta", weight=3];
2454 -> 2475[label="",style="dashed", color="magenta", weight=3];
2454 -> 2476[label="",style="dashed", color="magenta", weight=3];
2519[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz1700 vuz162 (primGEqNatS vuz1700 vuz162))) (Pos Zero)) (Integer (Pos (Succ vuz162))) (Integer (Pos (primModNatS0 vuz1700 vuz162 (primGEqNatS vuz1700 vuz162))))",fontsize=16,color="burlywood",shape="box"];3453[label="vuz1700/Succ vuz17000",fontsize=10,color="white",style="solid",shape="box"];2519 -> 3453[label="",style="solid", color="burlywood", weight=9];
3453 -> 2530[label="",style="solid", color="burlywood", weight=3];
3454[label="vuz1700/Zero",fontsize=10,color="white",style="solid",shape="box"];2519 -> 3454[label="",style="solid", color="burlywood", weight=9];
3454 -> 2531[label="",style="solid", color="burlywood", weight=3];
2520[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ vuz162))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2520 -> 2532[label="",style="solid", color="black", weight=3];
1353 -> 1348[label="",style="dashed", color="red", weight=0];
1353[label="primDivNatS vuz63 (Succ vuz3100)",fontsize=16,color="magenta"];1353 -> 1368[label="",style="dashed", color="magenta", weight=3];
1337[label="Pos (primDivNatS vuz45 (Succ vuz3100))",fontsize=16,color="green",shape="box"];1337 -> 1348[label="",style="dashed", color="green", weight=3];
3161[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS (Succ vuz2020) vuz203))) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS (Succ vuz2020) vuz203))))",fontsize=16,color="burlywood",shape="box"];3456[label="vuz203/Succ vuz2030",fontsize=10,color="white",style="solid",shape="box"];3161 -> 3456[label="",style="solid", color="burlywood", weight=9];
3456 -> 3168[label="",style="solid", color="burlywood", weight=3];
3457[label="vuz203/Zero",fontsize=10,color="white",style="solid",shape="box"];3161 -> 3457[label="",style="solid", color="burlywood", weight=9];
3457 -> 3169[label="",style="solid", color="burlywood", weight=3];
3162[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS Zero vuz203))) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS Zero vuz203))))",fontsize=16,color="burlywood",shape="box"];3458[label="vuz203/Succ vuz2030",fontsize=10,color="white",style="solid",shape="box"];3162 -> 3458[label="",style="solid", color="burlywood", weight=9];
3458 -> 3170[label="",style="solid", color="burlywood", weight=3];
3459[label="vuz203/Zero",fontsize=10,color="white",style="solid",shape="box"];3162 -> 3459[label="",style="solid", color="burlywood", weight=9];
3459 -> 3171[label="",style="solid", color="burlywood", weight=3];
2470 -> 2081[label="",style="dashed", color="red", weight=0];
2470[label="primMinusNatS (Succ vuz15800) Zero",fontsize=16,color="magenta"];2470 -> 2506[label="",style="dashed", color="magenta", weight=3];
2470 -> 2507[label="",style="dashed", color="magenta", weight=3];
2471 -> 2081[label="",style="dashed", color="red", weight=0];
2471[label="primMinusNatS (Succ vuz15800) Zero",fontsize=16,color="magenta"];2471 -> 2508[label="",style="dashed", color="magenta", weight=3];
2471 -> 2509[label="",style="dashed", color="magenta", weight=3];
2472[label="Zero",fontsize=16,color="green",shape="box"];2473[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 False (Integer (Pos (Succ (Succ vuz1480)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2473 -> 2510[label="",style="solid", color="black", weight=3];
2474 -> 2081[label="",style="dashed", color="red", weight=0];
2474[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];2474 -> 2511[label="",style="dashed", color="magenta", weight=3];
2474 -> 2512[label="",style="dashed", color="magenta", weight=3];
2475 -> 2081[label="",style="dashed", color="red", weight=0];
2475[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];2475 -> 2513[label="",style="dashed", color="magenta", weight=3];
2475 -> 2514[label="",style="dashed", color="magenta", weight=3];
2476[label="Zero",fontsize=16,color="green",shape="box"];2530[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz17000) vuz162 (primGEqNatS (Succ vuz17000) vuz162))) (Pos Zero)) (Integer (Pos (Succ vuz162))) (Integer (Pos (primModNatS0 (Succ vuz17000) vuz162 (primGEqNatS (Succ vuz17000) vuz162))))",fontsize=16,color="burlywood",shape="box"];3464[label="vuz162/Succ vuz1620",fontsize=10,color="white",style="solid",shape="box"];2530 -> 3464[label="",style="solid", color="burlywood", weight=9];
3464 -> 2547[label="",style="solid", color="burlywood", weight=3];
3465[label="vuz162/Zero",fontsize=10,color="white",style="solid",shape="box"];2530 -> 3465[label="",style="solid", color="burlywood", weight=9];
3465 -> 2548[label="",style="solid", color="burlywood", weight=3];
2531[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz162 (primGEqNatS Zero vuz162))) (Pos Zero)) (Integer (Pos (Succ vuz162))) (Integer (Pos (primModNatS0 Zero vuz162 (primGEqNatS Zero vuz162))))",fontsize=16,color="burlywood",shape="box"];3466[label="vuz162/Succ vuz1620",fontsize=10,color="white",style="solid",shape="box"];2531 -> 3466[label="",style="solid", color="burlywood", weight=9];
3466 -> 2549[label="",style="solid", color="burlywood", weight=3];
3467[label="vuz162/Zero",fontsize=10,color="white",style="solid",shape="box"];2531 -> 3467[label="",style="solid", color="burlywood", weight=9];
3467 -> 2550[label="",style="solid", color="burlywood", weight=3];
2532[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz162))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2532 -> 2551[label="",style="solid", color="black", weight=3];
1368[label="vuz63",fontsize=16,color="green",shape="box"];1348[label="primDivNatS vuz45 (Succ vuz3100)",fontsize=16,color="burlywood",shape="triangle"];3468[label="vuz45/Succ vuz450",fontsize=10,color="white",style="solid",shape="box"];1348 -> 3468[label="",style="solid", color="burlywood", weight=9];
3468 -> 1362[label="",style="solid", color="burlywood", weight=3];
3469[label="vuz45/Zero",fontsize=10,color="white",style="solid",shape="box"];1348 -> 3469[label="",style="solid", color="burlywood", weight=9];
3469 -> 1363[label="",style="solid", color="burlywood", weight=3];
3168[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS (Succ vuz2020) (Succ vuz2030)))) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS (Succ vuz2020) (Succ vuz2030)))))",fontsize=16,color="black",shape="box"];3168 -> 3176[label="",style="solid", color="black", weight=3];
3169[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS (Succ vuz2020) Zero))) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS (Succ vuz2020) Zero))))",fontsize=16,color="black",shape="box"];3169 -> 3177[label="",style="solid", color="black", weight=3];
3170[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS Zero (Succ vuz2030)))) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS Zero (Succ vuz2030)))))",fontsize=16,color="black",shape="box"];3170 -> 3178[label="",style="solid", color="black", weight=3];
3171[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];3171 -> 3179[label="",style="solid", color="black", weight=3];
2506[label="Zero",fontsize=16,color="green",shape="box"];2507[label="Succ vuz15800",fontsize=16,color="green",shape="box"];2081[label="primMinusNatS vuz1270 vuz128",fontsize=16,color="burlywood",shape="triangle"];3470[label="vuz1270/Succ vuz12700",fontsize=10,color="white",style="solid",shape="box"];2081 -> 3470[label="",style="solid", color="burlywood", weight=9];
3470 -> 2093[label="",style="solid", color="burlywood", weight=3];
3471[label="vuz1270/Zero",fontsize=10,color="white",style="solid",shape="box"];2081 -> 3471[label="",style="solid", color="burlywood", weight=9];
3471 -> 2094[label="",style="solid", color="burlywood", weight=3];
2508[label="Zero",fontsize=16,color="green",shape="box"];2509[label="Succ vuz15800",fontsize=16,color="green",shape="box"];2510[label="Integer (Pos vuz146) `quot` gcd0Gcd'0 (Integer (Pos (Succ (Succ vuz1480)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2510 -> 2526[label="",style="solid", color="black", weight=3];
2511[label="Zero",fontsize=16,color="green",shape="box"];2512[label="Zero",fontsize=16,color="green",shape="box"];2513[label="Zero",fontsize=16,color="green",shape="box"];2514[label="Zero",fontsize=16,color="green",shape="box"];2547[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz17000) (Succ vuz1620) (primGEqNatS (Succ vuz17000) (Succ vuz1620)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1620)))) (Integer (Pos (primModNatS0 (Succ vuz17000) (Succ vuz1620) (primGEqNatS (Succ vuz17000) (Succ vuz1620)))))",fontsize=16,color="black",shape="box"];2547 -> 2609[label="",style="solid", color="black", weight=3];
2548[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz17000) Zero (primGEqNatS (Succ vuz17000) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz17000) Zero (primGEqNatS (Succ vuz17000) Zero))))",fontsize=16,color="black",shape="box"];2548 -> 2610[label="",style="solid", color="black", weight=3];
2549[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1620) (primGEqNatS Zero (Succ vuz1620)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1620)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1620) (primGEqNatS Zero (Succ vuz1620)))))",fontsize=16,color="black",shape="box"];2549 -> 2611[label="",style="solid", color="black", weight=3];
2550[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];2550 -> 2612[label="",style="solid", color="black", weight=3];
2551 -> 1312[label="",style="dashed", color="red", weight=0];
2551[label="Integer (Neg vuz160) `quot` Integer (Pos (Succ vuz162))",fontsize=16,color="magenta"];2551 -> 2613[label="",style="dashed", color="magenta", weight=3];
2551 -> 2614[label="",style="dashed", color="magenta", weight=3];
1362[label="primDivNatS (Succ vuz450) (Succ vuz3100)",fontsize=16,color="black",shape="box"];1362 -> 1375[label="",style="solid", color="black", weight=3];
1363[label="primDivNatS Zero (Succ vuz3100)",fontsize=16,color="black",shape="box"];1363 -> 1376[label="",style="solid", color="black", weight=3];
3176 -> 3110[label="",style="dashed", color="red", weight=0];
3176[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS vuz2020 vuz2030))) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (primModNatS0 (Succ vuz200) vuz201 (primGEqNatS vuz2020 vuz2030))))",fontsize=16,color="magenta"];3176 -> 3192[label="",style="dashed", color="magenta", weight=3];
3176 -> 3193[label="",style="dashed", color="magenta", weight=3];
3177[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz200) vuz201 True)) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (primModNatS0 (Succ vuz200) vuz201 True)))",fontsize=16,color="black",shape="triangle"];3177 -> 3194[label="",style="solid", color="black", weight=3];
3178[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz200) vuz201 False)) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (primModNatS0 (Succ vuz200) vuz201 False)))",fontsize=16,color="black",shape="box"];3178 -> 3195[label="",style="solid", color="black", weight=3];
3179 -> 3177[label="",style="dashed", color="red", weight=0];
3179[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz200) vuz201 True)) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (primModNatS0 (Succ vuz200) vuz201 True)))",fontsize=16,color="magenta"];2093[label="primMinusNatS (Succ vuz12700) vuz128",fontsize=16,color="burlywood",shape="box"];3475[label="vuz128/Succ vuz1280",fontsize=10,color="white",style="solid",shape="box"];2093 -> 3475[label="",style="solid", color="burlywood", weight=9];
3475 -> 2097[label="",style="solid", color="burlywood", weight=3];
3476[label="vuz128/Zero",fontsize=10,color="white",style="solid",shape="box"];2093 -> 3476[label="",style="solid", color="burlywood", weight=9];
3476 -> 2098[label="",style="solid", color="burlywood", weight=3];
2094[label="primMinusNatS Zero vuz128",fontsize=16,color="burlywood",shape="box"];3477[label="vuz128/Succ vuz1280",fontsize=10,color="white",style="solid",shape="box"];2094 -> 3477[label="",style="solid", color="burlywood", weight=9];
3477 -> 2099[label="",style="solid", color="burlywood", weight=3];
3478[label="vuz128/Zero",fontsize=10,color="white",style="solid",shape="box"];2094 -> 3478[label="",style="solid", color="burlywood", weight=9];
3478 -> 2100[label="",style="solid", color="burlywood", weight=3];
2526[label="Integer (Pos vuz146) `quot` gcd0Gcd' (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1480))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2526 -> 2544[label="",style="solid", color="black", weight=3];
2609 -> 3235[label="",style="dashed", color="red", weight=0];
2609[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz17000) (Succ vuz1620) (primGEqNatS vuz17000 vuz1620))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1620)))) (Integer (Pos (primModNatS0 (Succ vuz17000) (Succ vuz1620) (primGEqNatS vuz17000 vuz1620))))",fontsize=16,color="magenta"];2609 -> 3236[label="",style="dashed", color="magenta", weight=3];
2609 -> 3237[label="",style="dashed", color="magenta", weight=3];
2609 -> 3238[label="",style="dashed", color="magenta", weight=3];
2609 -> 3239[label="",style="dashed", color="magenta", weight=3];
2609 -> 3240[label="",style="dashed", color="magenta", weight=3];
2610[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz17000) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz17000) Zero True)))",fontsize=16,color="black",shape="box"];2610 -> 2628[label="",style="solid", color="black", weight=3];
2611[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1620) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1620)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1620) False)))",fontsize=16,color="black",shape="box"];2611 -> 2629[label="",style="solid", color="black", weight=3];
2612[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="black",shape="box"];2612 -> 2630[label="",style="solid", color="black", weight=3];
2613[label="vuz162",fontsize=16,color="green",shape="box"];2614[label="vuz160",fontsize=16,color="green",shape="box"];1375[label="primDivNatS0 vuz450 vuz3100 (primGEqNatS vuz450 vuz3100)",fontsize=16,color="burlywood",shape="box"];3480[label="vuz450/Succ vuz4500",fontsize=10,color="white",style="solid",shape="box"];1375 -> 3480[label="",style="solid", color="burlywood", weight=9];
3480 -> 1390[label="",style="solid", color="burlywood", weight=3];
3481[label="vuz450/Zero",fontsize=10,color="white",style="solid",shape="box"];1375 -> 3481[label="",style="solid", color="burlywood", weight=9];
3481 -> 1391[label="",style="solid", color="burlywood", weight=3];
1376[label="Zero",fontsize=16,color="green",shape="box"];3192[label="vuz2030",fontsize=16,color="green",shape="box"];3193[label="vuz2020",fontsize=16,color="green",shape="box"];3194 -> 2309[label="",style="dashed", color="red", weight=0];
3194[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz200) vuz201) (Succ vuz201))) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz200) vuz201) (Succ vuz201))))",fontsize=16,color="magenta"];3194 -> 3210[label="",style="dashed", color="magenta", weight=3];
3194 -> 3211[label="",style="dashed", color="magenta", weight=3];
3194 -> 3212[label="",style="dashed", color="magenta", weight=3];
3194 -> 3213[label="",style="dashed", color="magenta", weight=3];
3195[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ (Succ vuz200))) (Pos Zero)) (Integer (Pos (Succ vuz201))) (Integer (Pos (Succ (Succ vuz200))))",fontsize=16,color="black",shape="box"];3195 -> 3214[label="",style="solid", color="black", weight=3];
2097[label="primMinusNatS (Succ vuz12700) (Succ vuz1280)",fontsize=16,color="black",shape="box"];2097 -> 2114[label="",style="solid", color="black", weight=3];
2098[label="primMinusNatS (Succ vuz12700) Zero",fontsize=16,color="black",shape="box"];2098 -> 2115[label="",style="solid", color="black", weight=3];
2099[label="primMinusNatS Zero (Succ vuz1280)",fontsize=16,color="black",shape="box"];2099 -> 2116[label="",style="solid", color="black", weight=3];
2100[label="primMinusNatS Zero Zero",fontsize=16,color="black",shape="box"];2100 -> 2117[label="",style="solid", color="black", weight=3];
2544[label="Integer (Pos vuz146) `quot` gcd0Gcd'2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1480))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2544 -> 2565[label="",style="solid", color="black", weight=3];
3236[label="vuz1620",fontsize=16,color="green",shape="box"];3237[label="vuz160",fontsize=16,color="green",shape="box"];3238[label="vuz17000",fontsize=16,color="green",shape="box"];3239[label="Succ vuz1620",fontsize=16,color="green",shape="box"];3240[label="vuz17000",fontsize=16,color="green",shape="box"];3235[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS vuz216 vuz217))) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS vuz216 vuz217))))",fontsize=16,color="burlywood",shape="triangle"];3483[label="vuz216/Succ vuz2160",fontsize=10,color="white",style="solid",shape="box"];3235 -> 3483[label="",style="solid", color="burlywood", weight=9];
3483 -> 3286[label="",style="solid", color="burlywood", weight=3];
3484[label="vuz216/Zero",fontsize=10,color="white",style="solid",shape="box"];3235 -> 3484[label="",style="solid", color="burlywood", weight=9];
3484 -> 3287[label="",style="solid", color="burlywood", weight=3];
2628 -> 2477[label="",style="dashed", color="red", weight=0];
2628[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz17000) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz17000) Zero) (Succ Zero))))",fontsize=16,color="magenta"];2628 -> 2651[label="",style="dashed", color="magenta", weight=3];
2628 -> 2652[label="",style="dashed", color="magenta", weight=3];
2628 -> 2653[label="",style="dashed", color="magenta", weight=3];
2629[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1620)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2629 -> 2654[label="",style="solid", color="black", weight=3];
2630 -> 2477[label="",style="dashed", color="red", weight=0];
2630[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))))",fontsize=16,color="magenta"];2630 -> 2655[label="",style="dashed", color="magenta", weight=3];
2630 -> 2656[label="",style="dashed", color="magenta", weight=3];
2630 -> 2657[label="",style="dashed", color="magenta", weight=3];
1390[label="primDivNatS0 (Succ vuz4500) vuz3100 (primGEqNatS (Succ vuz4500) vuz3100)",fontsize=16,color="burlywood",shape="box"];3487[label="vuz3100/Succ vuz31000",fontsize=10,color="white",style="solid",shape="box"];1390 -> 3487[label="",style="solid", color="burlywood", weight=9];
3487 -> 1408[label="",style="solid", color="burlywood", weight=3];
3488[label="vuz3100/Zero",fontsize=10,color="white",style="solid",shape="box"];1390 -> 3488[label="",style="solid", color="burlywood", weight=9];
3488 -> 1409[label="",style="solid", color="burlywood", weight=3];
1391[label="primDivNatS0 Zero vuz3100 (primGEqNatS Zero vuz3100)",fontsize=16,color="burlywood",shape="box"];3489[label="vuz3100/Succ vuz31000",fontsize=10,color="white",style="solid",shape="box"];1391 -> 3489[label="",style="solid", color="burlywood", weight=9];
3489 -> 1410[label="",style="solid", color="burlywood", weight=3];
3490[label="vuz3100/Zero",fontsize=10,color="white",style="solid",shape="box"];1391 -> 3490[label="",style="solid", color="burlywood", weight=9];
3490 -> 1411[label="",style="solid", color="burlywood", weight=3];
3210 -> 2081[label="",style="dashed", color="red", weight=0];
3210[label="primMinusNatS (Succ vuz200) vuz201",fontsize=16,color="magenta"];3210 -> 3226[label="",style="dashed", color="magenta", weight=3];
3210 -> 3227[label="",style="dashed", color="magenta", weight=3];
3211 -> 2081[label="",style="dashed", color="red", weight=0];
3211[label="primMinusNatS (Succ vuz200) vuz201",fontsize=16,color="magenta"];3211 -> 3228[label="",style="dashed", color="magenta", weight=3];
3211 -> 3229[label="",style="dashed", color="magenta", weight=3];
3212[label="vuz201",fontsize=16,color="green",shape="box"];3213[label="vuz199",fontsize=16,color="green",shape="box"];3214[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 False (Integer (Pos (Succ vuz201))) (Integer (Pos (Succ (Succ vuz200))))",fontsize=16,color="black",shape="box"];3214 -> 3230[label="",style="solid", color="black", weight=3];
2114 -> 2081[label="",style="dashed", color="red", weight=0];
2114[label="primMinusNatS vuz12700 vuz1280",fontsize=16,color="magenta"];2114 -> 2163[label="",style="dashed", color="magenta", weight=3];
2114 -> 2164[label="",style="dashed", color="magenta", weight=3];
2115[label="Succ vuz12700",fontsize=16,color="green",shape="box"];2116[label="Zero",fontsize=16,color="green",shape="box"];2117[label="Zero",fontsize=16,color="green",shape="box"];2565 -> 1270[label="",style="dashed", color="red", weight=0];
2565[label="Integer (Pos vuz146) `quot` gcd0Gcd'1 (Integer (Pos (Succ (Succ vuz1480))) `rem` Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1480))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];2565 -> 2621[label="",style="dashed", color="magenta", weight=3];
2565 -> 2622[label="",style="dashed", color="magenta", weight=3];
2565 -> 2623[label="",style="dashed", color="magenta", weight=3];
3286[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS (Succ vuz2160) vuz217))) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS (Succ vuz2160) vuz217))))",fontsize=16,color="burlywood",shape="box"];3495[label="vuz217/Succ vuz2170",fontsize=10,color="white",style="solid",shape="box"];3286 -> 3495[label="",style="solid", color="burlywood", weight=9];
3495 -> 3289[label="",style="solid", color="burlywood", weight=3];
3496[label="vuz217/Zero",fontsize=10,color="white",style="solid",shape="box"];3286 -> 3496[label="",style="solid", color="burlywood", weight=9];
3496 -> 3290[label="",style="solid", color="burlywood", weight=3];
3287[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS Zero vuz217))) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS Zero vuz217))))",fontsize=16,color="burlywood",shape="box"];3497[label="vuz217/Succ vuz2170",fontsize=10,color="white",style="solid",shape="box"];3287 -> 3497[label="",style="solid", color="burlywood", weight=9];
3497 -> 3291[label="",style="solid", color="burlywood", weight=3];
3498[label="vuz217/Zero",fontsize=10,color="white",style="solid",shape="box"];3287 -> 3498[label="",style="solid", color="burlywood", weight=9];
3498 -> 3292[label="",style="solid", color="burlywood", weight=3];
2651 -> 2081[label="",style="dashed", color="red", weight=0];
2651[label="primMinusNatS (Succ vuz17000) Zero",fontsize=16,color="magenta"];2651 -> 2680[label="",style="dashed", color="magenta", weight=3];
2651 -> 2681[label="",style="dashed", color="magenta", weight=3];
2652[label="Zero",fontsize=16,color="green",shape="box"];2653 -> 2081[label="",style="dashed", color="red", weight=0];
2653[label="primMinusNatS (Succ vuz17000) Zero",fontsize=16,color="magenta"];2653 -> 2682[label="",style="dashed", color="magenta", weight=3];
2653 -> 2683[label="",style="dashed", color="magenta", weight=3];
2654[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 False (Integer (Pos (Succ (Succ vuz1620)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2654 -> 2684[label="",style="solid", color="black", weight=3];
2655 -> 2081[label="",style="dashed", color="red", weight=0];
2655[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];2655 -> 2685[label="",style="dashed", color="magenta", weight=3];
2655 -> 2686[label="",style="dashed", color="magenta", weight=3];
2656[label="Zero",fontsize=16,color="green",shape="box"];2657 -> 2081[label="",style="dashed", color="red", weight=0];
2657[label="primMinusNatS Zero Zero",fontsize=16,color="magenta"];2657 -> 2687[label="",style="dashed", color="magenta", weight=3];
2657 -> 2688[label="",style="dashed", color="magenta", weight=3];
1408[label="primDivNatS0 (Succ vuz4500) (Succ vuz31000) (primGEqNatS (Succ vuz4500) (Succ vuz31000))",fontsize=16,color="black",shape="box"];1408 -> 1431[label="",style="solid", color="black", weight=3];
1409[label="primDivNatS0 (Succ vuz4500) Zero (primGEqNatS (Succ vuz4500) Zero)",fontsize=16,color="black",shape="box"];1409 -> 1432[label="",style="solid", color="black", weight=3];
1410[label="primDivNatS0 Zero (Succ vuz31000) (primGEqNatS Zero (Succ vuz31000))",fontsize=16,color="black",shape="box"];1410 -> 1433[label="",style="solid", color="black", weight=3];
1411[label="primDivNatS0 Zero Zero (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];1411 -> 1434[label="",style="solid", color="black", weight=3];
3226[label="vuz201",fontsize=16,color="green",shape="box"];3227[label="Succ vuz200",fontsize=16,color="green",shape="box"];3228[label="vuz201",fontsize=16,color="green",shape="box"];3229[label="Succ vuz200",fontsize=16,color="green",shape="box"];3230[label="Integer (Pos vuz199) `quot` gcd0Gcd'0 (Integer (Pos (Succ vuz201))) (Integer (Pos (Succ (Succ vuz200))))",fontsize=16,color="black",shape="box"];3230 -> 3288[label="",style="solid", color="black", weight=3];
2163[label="vuz1280",fontsize=16,color="green",shape="box"];2164[label="vuz12700",fontsize=16,color="green",shape="box"];2621[label="Zero",fontsize=16,color="green",shape="box"];2622[label="Succ vuz1480",fontsize=16,color="green",shape="box"];2623[label="vuz146",fontsize=16,color="green",shape="box"];3289[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS (Succ vuz2160) (Succ vuz2170)))) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS (Succ vuz2160) (Succ vuz2170)))))",fontsize=16,color="black",shape="box"];3289 -> 3294[label="",style="solid", color="black", weight=3];
3290[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS (Succ vuz2160) Zero))) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS (Succ vuz2160) Zero))))",fontsize=16,color="black",shape="box"];3290 -> 3295[label="",style="solid", color="black", weight=3];
3291[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS Zero (Succ vuz2170)))) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS Zero (Succ vuz2170)))))",fontsize=16,color="black",shape="box"];3291 -> 3296[label="",style="solid", color="black", weight=3];
3292[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];3292 -> 3297[label="",style="solid", color="black", weight=3];
2680[label="Zero",fontsize=16,color="green",shape="box"];2681[label="Succ vuz17000",fontsize=16,color="green",shape="box"];2682[label="Zero",fontsize=16,color="green",shape="box"];2683[label="Succ vuz17000",fontsize=16,color="green",shape="box"];2684[label="Integer (Neg vuz160) `quot` gcd0Gcd'0 (Integer (Pos (Succ (Succ vuz1620)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2684 -> 2707[label="",style="solid", color="black", weight=3];
2685[label="Zero",fontsize=16,color="green",shape="box"];2686[label="Zero",fontsize=16,color="green",shape="box"];2687[label="Zero",fontsize=16,color="green",shape="box"];2688[label="Zero",fontsize=16,color="green",shape="box"];1431 -> 2568[label="",style="dashed", color="red", weight=0];
1431[label="primDivNatS0 (Succ vuz4500) (Succ vuz31000) (primGEqNatS vuz4500 vuz31000)",fontsize=16,color="magenta"];1431 -> 2569[label="",style="dashed", color="magenta", weight=3];
1431 -> 2570[label="",style="dashed", color="magenta", weight=3];
1431 -> 2571[label="",style="dashed", color="magenta", weight=3];
1431 -> 2572[label="",style="dashed", color="magenta", weight=3];
1432[label="primDivNatS0 (Succ vuz4500) Zero True",fontsize=16,color="black",shape="box"];1432 -> 1453[label="",style="solid", color="black", weight=3];
1433[label="primDivNatS0 Zero (Succ vuz31000) False",fontsize=16,color="black",shape="box"];1433 -> 1454[label="",style="solid", color="black", weight=3];
1434[label="primDivNatS0 Zero Zero True",fontsize=16,color="black",shape="box"];1434 -> 1455[label="",style="solid", color="black", weight=3];
3288[label="Integer (Pos vuz199) `quot` gcd0Gcd' (Integer (Pos (Succ (Succ vuz200)))) (Integer (Pos (Succ vuz201)) `rem` Integer (Pos (Succ (Succ vuz200))))",fontsize=16,color="black",shape="box"];3288 -> 3293[label="",style="solid", color="black", weight=3];
3294 -> 3235[label="",style="dashed", color="red", weight=0];
3294[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS vuz2160 vuz2170))) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (primModNatS0 (Succ vuz214) vuz215 (primGEqNatS vuz2160 vuz2170))))",fontsize=16,color="magenta"];3294 -> 3299[label="",style="dashed", color="magenta", weight=3];
3294 -> 3300[label="",style="dashed", color="magenta", weight=3];
3295[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz214) vuz215 True)) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (primModNatS0 (Succ vuz214) vuz215 True)))",fontsize=16,color="black",shape="triangle"];3295 -> 3301[label="",style="solid", color="black", weight=3];
3296[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz214) vuz215 False)) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (primModNatS0 (Succ vuz214) vuz215 False)))",fontsize=16,color="black",shape="box"];3296 -> 3302[label="",style="solid", color="black", weight=3];
3297 -> 3295[label="",style="dashed", color="red", weight=0];
3297[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz214) vuz215 True)) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (primModNatS0 (Succ vuz214) vuz215 True)))",fontsize=16,color="magenta"];2707[label="Integer (Neg vuz160) `quot` gcd0Gcd' (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1620))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2707 -> 2732[label="",style="solid", color="black", weight=3];
2569[label="vuz4500",fontsize=16,color="green",shape="box"];2570[label="vuz31000",fontsize=16,color="green",shape="box"];2571[label="vuz4500",fontsize=16,color="green",shape="box"];2572[label="vuz31000",fontsize=16,color="green",shape="box"];2568[label="primDivNatS0 (Succ vuz180) (Succ vuz181) (primGEqNatS vuz182 vuz183)",fontsize=16,color="burlywood",shape="triangle"];3506[label="vuz182/Succ vuz1820",fontsize=10,color="white",style="solid",shape="box"];2568 -> 3506[label="",style="solid", color="burlywood", weight=9];
3506 -> 2624[label="",style="solid", color="burlywood", weight=3];
3507[label="vuz182/Zero",fontsize=10,color="white",style="solid",shape="box"];2568 -> 3507[label="",style="solid", color="burlywood", weight=9];
3507 -> 2625[label="",style="solid", color="burlywood", weight=3];
1453[label="Succ (primDivNatS (primMinusNatS (Succ vuz4500) Zero) (Succ Zero))",fontsize=16,color="green",shape="box"];1453 -> 1478[label="",style="dashed", color="green", weight=3];
1454[label="Zero",fontsize=16,color="green",shape="box"];1455[label="Succ (primDivNatS (primMinusNatS Zero Zero) (Succ Zero))",fontsize=16,color="green",shape="box"];1455 -> 1479[label="",style="dashed", color="green", weight=3];
3293[label="Integer (Pos vuz199) `quot` gcd0Gcd'2 (Integer (Pos (Succ (Succ vuz200)))) (Integer (Pos (Succ vuz201)) `rem` Integer (Pos (Succ (Succ vuz200))))",fontsize=16,color="black",shape="box"];3293 -> 3298[label="",style="solid", color="black", weight=3];
3299[label="vuz2170",fontsize=16,color="green",shape="box"];3300[label="vuz2160",fontsize=16,color="green",shape="box"];3301 -> 2477[label="",style="dashed", color="red", weight=0];
3301[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz214) vuz215) (Succ vuz215))) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz214) vuz215) (Succ vuz215))))",fontsize=16,color="magenta"];3301 -> 3306[label="",style="dashed", color="magenta", weight=3];
3301 -> 3307[label="",style="dashed", color="magenta", weight=3];
3301 -> 3308[label="",style="dashed", color="magenta", weight=3];
3301 -> 3309[label="",style="dashed", color="magenta", weight=3];
3302[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ (Succ vuz214))) (Pos Zero)) (Integer (Pos (Succ vuz215))) (Integer (Pos (Succ (Succ vuz214))))",fontsize=16,color="black",shape="box"];3302 -> 3310[label="",style="solid", color="black", weight=3];
2732[label="Integer (Neg vuz160) `quot` gcd0Gcd'2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1620))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2732 -> 2762[label="",style="solid", color="black", weight=3];
2624[label="primDivNatS0 (Succ vuz180) (Succ vuz181) (primGEqNatS (Succ vuz1820) vuz183)",fontsize=16,color="burlywood",shape="box"];3509[label="vuz183/Succ vuz1830",fontsize=10,color="white",style="solid",shape="box"];2624 -> 3509[label="",style="solid", color="burlywood", weight=9];
3509 -> 2643[label="",style="solid", color="burlywood", weight=3];
3510[label="vuz183/Zero",fontsize=10,color="white",style="solid",shape="box"];2624 -> 3510[label="",style="solid", color="burlywood", weight=9];
3510 -> 2644[label="",style="solid", color="burlywood", weight=3];
2625[label="primDivNatS0 (Succ vuz180) (Succ vuz181) (primGEqNatS Zero vuz183)",fontsize=16,color="burlywood",shape="box"];3511[label="vuz183/Succ vuz1830",fontsize=10,color="white",style="solid",shape="box"];2625 -> 3511[label="",style="solid", color="burlywood", weight=9];
3511 -> 2645[label="",style="solid", color="burlywood", weight=3];
3512[label="vuz183/Zero",fontsize=10,color="white",style="solid",shape="box"];2625 -> 3512[label="",style="solid", color="burlywood", weight=9];
3512 -> 2646[label="",style="solid", color="burlywood", weight=3];
1478 -> 1348[label="",style="dashed", color="red", weight=0];
1478[label="primDivNatS (primMinusNatS (Succ vuz4500) Zero) (Succ Zero)",fontsize=16,color="magenta"];1478 -> 1504[label="",style="dashed", color="magenta", weight=3];
1478 -> 1505[label="",style="dashed", color="magenta", weight=3];
1479 -> 1348[label="",style="dashed", color="red", weight=0];
1479[label="primDivNatS (primMinusNatS Zero Zero) (Succ Zero)",fontsize=16,color="magenta"];1479 -> 1506[label="",style="dashed", color="magenta", weight=3];
1479 -> 1507[label="",style="dashed", color="magenta", weight=3];
3298 -> 1270[label="",style="dashed", color="red", weight=0];
3298[label="Integer (Pos vuz199) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz201)) `rem` Integer (Pos (Succ (Succ vuz200))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz200)))) (Integer (Pos (Succ vuz201)) `rem` Integer (Pos (Succ (Succ vuz200))))",fontsize=16,color="magenta"];3298 -> 3303[label="",style="dashed", color="magenta", weight=3];
3298 -> 3304[label="",style="dashed", color="magenta", weight=3];
3298 -> 3305[label="",style="dashed", color="magenta", weight=3];
3306 -> 2081[label="",style="dashed", color="red", weight=0];
3306[label="primMinusNatS (Succ vuz214) vuz215",fontsize=16,color="magenta"];3306 -> 3311[label="",style="dashed", color="magenta", weight=3];
3306 -> 3312[label="",style="dashed", color="magenta", weight=3];
3307[label="vuz213",fontsize=16,color="green",shape="box"];3308[label="vuz215",fontsize=16,color="green",shape="box"];3309 -> 2081[label="",style="dashed", color="red", weight=0];
3309[label="primMinusNatS (Succ vuz214) vuz215",fontsize=16,color="magenta"];3309 -> 3313[label="",style="dashed", color="magenta", weight=3];
3309 -> 3314[label="",style="dashed", color="magenta", weight=3];
3310[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 False (Integer (Pos (Succ vuz215))) (Integer (Pos (Succ (Succ vuz214))))",fontsize=16,color="black",shape="box"];3310 -> 3315[label="",style="solid", color="black", weight=3];
2762[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (Integer (Pos (Succ (Succ vuz1620))) `rem` Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1620))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2762 -> 2782[label="",style="solid", color="black", weight=3];
2643[label="primDivNatS0 (Succ vuz180) (Succ vuz181) (primGEqNatS (Succ vuz1820) (Succ vuz1830))",fontsize=16,color="black",shape="box"];2643 -> 2672[label="",style="solid", color="black", weight=3];
2644[label="primDivNatS0 (Succ vuz180) (Succ vuz181) (primGEqNatS (Succ vuz1820) Zero)",fontsize=16,color="black",shape="box"];2644 -> 2673[label="",style="solid", color="black", weight=3];
2645[label="primDivNatS0 (Succ vuz180) (Succ vuz181) (primGEqNatS Zero (Succ vuz1830))",fontsize=16,color="black",shape="box"];2645 -> 2674[label="",style="solid", color="black", weight=3];
2646[label="primDivNatS0 (Succ vuz180) (Succ vuz181) (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];2646 -> 2675[label="",style="solid", color="black", weight=3];
1504[label="Zero",fontsize=16,color="green",shape="box"];1505[label="primMinusNatS (Succ vuz4500) Zero",fontsize=16,color="black",shape="triangle"];1505 -> 1534[label="",style="solid", color="black", weight=3];
1506[label="Zero",fontsize=16,color="green",shape="box"];1507[label="primMinusNatS Zero Zero",fontsize=16,color="black",shape="triangle"];1507 -> 1535[label="",style="solid", color="black", weight=3];
3303[label="Succ vuz200",fontsize=16,color="green",shape="box"];3304[label="vuz201",fontsize=16,color="green",shape="box"];3305[label="vuz199",fontsize=16,color="green",shape="box"];3311[label="vuz215",fontsize=16,color="green",shape="box"];3312[label="Succ vuz214",fontsize=16,color="green",shape="box"];3313[label="vuz215",fontsize=16,color="green",shape="box"];3314[label="Succ vuz214",fontsize=16,color="green",shape="box"];3315[label="Integer (Neg vuz213) `quot` gcd0Gcd'0 (Integer (Pos (Succ vuz215))) (Integer (Pos (Succ (Succ vuz214))))",fontsize=16,color="black",shape="box"];3315 -> 3316[label="",style="solid", color="black", weight=3];
2782[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz1620))) (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz1620))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2782 -> 2805[label="",style="solid", color="black", weight=3];
2672 -> 2568[label="",style="dashed", color="red", weight=0];
2672[label="primDivNatS0 (Succ vuz180) (Succ vuz181) (primGEqNatS vuz1820 vuz1830)",fontsize=16,color="magenta"];2672 -> 2698[label="",style="dashed", color="magenta", weight=3];
2672 -> 2699[label="",style="dashed", color="magenta", weight=3];
2673[label="primDivNatS0 (Succ vuz180) (Succ vuz181) True",fontsize=16,color="black",shape="triangle"];2673 -> 2700[label="",style="solid", color="black", weight=3];
2674[label="primDivNatS0 (Succ vuz180) (Succ vuz181) False",fontsize=16,color="black",shape="box"];2674 -> 2701[label="",style="solid", color="black", weight=3];
2675 -> 2673[label="",style="dashed", color="red", weight=0];
2675[label="primDivNatS0 (Succ vuz180) (Succ vuz181) True",fontsize=16,color="magenta"];1534[label="Succ vuz4500",fontsize=16,color="green",shape="box"];1535[label="Zero",fontsize=16,color="green",shape="box"];3316[label="Integer (Neg vuz213) `quot` gcd0Gcd' (Integer (Pos (Succ (Succ vuz214)))) (Integer (Pos (Succ vuz215)) `rem` Integer (Pos (Succ (Succ vuz214))))",fontsize=16,color="black",shape="box"];3316 -> 3317[label="",style="solid", color="black", weight=3];
2805[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz1620))) (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz1620))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2805 -> 2834[label="",style="solid", color="black", weight=3];
2698[label="vuz1830",fontsize=16,color="green",shape="box"];2699[label="vuz1820",fontsize=16,color="green",shape="box"];2700[label="Succ (primDivNatS (primMinusNatS (Succ vuz180) (Succ vuz181)) (Succ (Succ vuz181)))",fontsize=16,color="green",shape="box"];2700 -> 2720[label="",style="dashed", color="green", weight=3];
2701[label="Zero",fontsize=16,color="green",shape="box"];3317[label="Integer (Neg vuz213) `quot` gcd0Gcd'2 (Integer (Pos (Succ (Succ vuz214)))) (Integer (Pos (Succ vuz215)) `rem` Integer (Pos (Succ (Succ vuz214))))",fontsize=16,color="black",shape="box"];3317 -> 3318[label="",style="solid", color="black", weight=3];
2834 -> 1311[label="",style="dashed", color="red", weight=0];
2834[label="Integer (Neg vuz160) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ (Succ vuz1620))) (Pos (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz1620))) (Pos (Succ Zero))))",fontsize=16,color="magenta"];2834 -> 2855[label="",style="dashed", color="magenta", weight=3];
2834 -> 2856[label="",style="dashed", color="magenta", weight=3];
2834 -> 2857[label="",style="dashed", color="magenta", weight=3];
2720 -> 1348[label="",style="dashed", color="red", weight=0];
2720[label="primDivNatS (primMinusNatS (Succ vuz180) (Succ vuz181)) (Succ (Succ vuz181))",fontsize=16,color="magenta"];2720 -> 2747[label="",style="dashed", color="magenta", weight=3];
2720 -> 2748[label="",style="dashed", color="magenta", weight=3];
3318[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz215)) `rem` Integer (Pos (Succ (Succ vuz214))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz214)))) (Integer (Pos (Succ vuz215)) `rem` Integer (Pos (Succ (Succ vuz214))))",fontsize=16,color="black",shape="box"];3318 -> 3319[label="",style="solid", color="black", weight=3];
2855[label="Succ vuz1620",fontsize=16,color="green",shape="box"];2856[label="Zero",fontsize=16,color="green",shape="box"];2857[label="vuz160",fontsize=16,color="green",shape="box"];2747[label="Succ vuz181",fontsize=16,color="green",shape="box"];2748 -> 2081[label="",style="dashed", color="red", weight=0];
2748[label="primMinusNatS (Succ vuz180) (Succ vuz181)",fontsize=16,color="magenta"];2748 -> 2772[label="",style="dashed", color="magenta", weight=3];
2748 -> 2773[label="",style="dashed", color="magenta", weight=3];
3319[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz215)) (Pos (Succ (Succ vuz214)))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz214)))) (Integer (primRemInt (Pos (Succ vuz215)) (Pos (Succ (Succ vuz214)))))",fontsize=16,color="black",shape="box"];3319 -> 3320[label="",style="solid", color="black", weight=3];
2772[label="Succ vuz181",fontsize=16,color="green",shape="box"];2773[label="Succ vuz180",fontsize=16,color="green",shape="box"];3320[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz215)) (Pos (Succ (Succ vuz214)))) == Integer (Pos Zero)) (Integer (Pos (Succ (Succ vuz214)))) (Integer (primRemInt (Pos (Succ vuz215)) (Pos (Succ (Succ vuz214)))))",fontsize=16,color="black",shape="box"];3320 -> 3321[label="",style="solid", color="black", weight=3];
3321 -> 1311[label="",style="dashed", color="red", weight=0];
3321[label="Integer (Neg vuz213) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz215)) (Pos (Succ (Succ vuz214)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz214)))) (Integer (primRemInt (Pos (Succ vuz215)) (Pos (Succ (Succ vuz214)))))",fontsize=16,color="magenta"];3321 -> 3322[label="",style="dashed", color="magenta", weight=3];
3321 -> 3323[label="",style="dashed", color="magenta", weight=3];
3321 -> 3324[label="",style="dashed", color="magenta", weight=3];
3322[label="vuz215",fontsize=16,color="green",shape="box"];3323[label="Succ vuz214",fontsize=16,color="green",shape="box"];3324[label="vuz213",fontsize=16,color="green",shape="box"];}

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primMulNat(Succ(vuz30000)) → new_primMulNat(vuz30000)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_primMulNat(Succ(vuz30000)) → new_primMulNat(vuz30000)
The graph contains the following edges 1 > 1

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primMinusNatS(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS(vuz12700, vuz1280)

From the DPs we obtained the following set of size-change graphs:

new_primMinusNatS(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS(vuz12700, vuz1280)
The graph contains the following edges 1 > 1, 2 > 2

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz180, vuz181, Zero, Zero) → new_primDivNatS00(vuz180, vuz181)
new_primDivNatS(Succ(Succ(vuz4500)), Succ(vuz31000)) → new_primDivNatS0(vuz4500, vuz31000, vuz4500, vuz31000)
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Succ(vuz1830)) → new_primDivNatS0(vuz180, vuz181, vuz1820, vuz1830)
new_primDivNatS00(vuz180, vuz181) → new_primDivNatS(new_primMinusNatS2(Succ(vuz180), Succ(vuz181)), Succ(vuz181))
new_primDivNatS(Succ(Succ(vuz4500)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz4500), Zero)
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz180), Succ(vuz181)), Succ(vuz181))
new_primDivNatS(Succ(Zero), Zero) → new_primDivNatS(new_primMinusNatS1, Zero)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)
new_primMinusNatS1 → Zero
new_primMinusNatS0(vuz4500) → Succ(vuz4500)

The set Q consists of the following terms:

new_primMinusNatS0(x0)
new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS1

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS(Succ(Succ(vuz4500)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz4500), Zero)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)
new_primMinusNatS1 → Zero
new_primMinusNatS0(vuz4500) → Succ(vuz4500)

The set Q consists of the following terms:

new_primMinusNatS0(x0)
new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS1

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS(Succ(Succ(vuz4500)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz4500), Zero)

The TRS R consists of the following rules:

new_primMinusNatS0(vuz4500) → Succ(vuz4500)

The set Q consists of the following terms:

new_primMinusNatS0(x0)
new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS1

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS1

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ RuleRemovalProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS(Succ(Succ(vuz4500)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz4500), Zero)

The TRS R consists of the following rules:

new_primMinusNatS0(vuz4500) → Succ(vuz4500)

The set Q consists of the following terms:

new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

new_primDivNatS(Succ(Succ(vuz4500)), Zero) → new_primDivNatS(new_primMinusNatS0(vuz4500), Zero)

Strictly oriented rules of the TRS R:

new_primMinusNatS0(vuz4500) → Succ(vuz4500)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + 2·x₁
POL(Zero) = 0
POL(new_primDivNatS(x₁, x₂)) = x₁ + x₂
POL(new_primMinusNatS0(x₁)) = 2 + 2·x₁

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ RuleRemovalProof

                                            ↳ QDP

                                              ↳ PisEmptyProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
P is empty.
R is empty.
The set Q consists of the following terms:

new_primMinusNatS0(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz180, vuz181, Zero, Zero) → new_primDivNatS00(vuz180, vuz181)
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Succ(vuz1830)) → new_primDivNatS0(vuz180, vuz181, vuz1820, vuz1830)
new_primDivNatS(Succ(Succ(vuz4500)), Succ(vuz31000)) → new_primDivNatS0(vuz4500, vuz31000, vuz4500, vuz31000)
new_primDivNatS00(vuz180, vuz181) → new_primDivNatS(new_primMinusNatS2(Succ(vuz180), Succ(vuz181)), Succ(vuz181))
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz180), Succ(vuz181)), Succ(vuz181))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)
new_primMinusNatS1 → Zero
new_primMinusNatS0(vuz4500) → Succ(vuz4500)

The set Q consists of the following terms:

new_primMinusNatS0(x0)
new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS1

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz180, vuz181, Zero, Zero) → new_primDivNatS00(vuz180, vuz181)
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Succ(vuz1830)) → new_primDivNatS0(vuz180, vuz181, vuz1820, vuz1830)
new_primDivNatS(Succ(Succ(vuz4500)), Succ(vuz31000)) → new_primDivNatS0(vuz4500, vuz31000, vuz4500, vuz31000)
new_primDivNatS00(vuz180, vuz181) → new_primDivNatS(new_primMinusNatS2(Succ(vuz180), Succ(vuz181)), Succ(vuz181))
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz180), Succ(vuz181)), Succ(vuz181))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS0(x0)
new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))
new_primMinusNatS1

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS0(x0)
new_primMinusNatS1

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz180, vuz181, Zero, Zero) → new_primDivNatS00(vuz180, vuz181)
new_primDivNatS(Succ(Succ(vuz4500)), Succ(vuz31000)) → new_primDivNatS0(vuz4500, vuz31000, vuz4500, vuz31000)
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Succ(vuz1830)) → new_primDivNatS0(vuz180, vuz181, vuz1820, vuz1830)
new_primDivNatS00(vuz180, vuz181) → new_primDivNatS(new_primMinusNatS2(Succ(vuz180), Succ(vuz181)), Succ(vuz181))
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz180), Succ(vuz181)), Succ(vuz181))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_primDivNatS00(vuz180, vuz181) → new_primDivNatS(new_primMinusNatS2(Succ(vuz180), Succ(vuz181)), Succ(vuz181)) at position [0] we obtained the following new rules:

new_primDivNatS00(vuz180, vuz181) → new_primDivNatS(new_primMinusNatS2(vuz180, vuz181), Succ(vuz181))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz180, vuz181, Zero, Zero) → new_primDivNatS00(vuz180, vuz181)
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Succ(vuz1830)) → new_primDivNatS0(vuz180, vuz181, vuz1820, vuz1830)
new_primDivNatS(Succ(Succ(vuz4500)), Succ(vuz31000)) → new_primDivNatS0(vuz4500, vuz31000, vuz4500, vuz31000)
new_primDivNatS00(vuz180, vuz181) → new_primDivNatS(new_primMinusNatS2(vuz180, vuz181), Succ(vuz181))
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz180), Succ(vuz181)), Succ(vuz181))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Zero) → new_primDivNatS(new_primMinusNatS2(Succ(vuz180), Succ(vuz181)), Succ(vuz181)) at position [0] we obtained the following new rules:

new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Zero) → new_primDivNatS(new_primMinusNatS2(vuz180, vuz181), Succ(vuz181))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz180, vuz181, Zero, Zero) → new_primDivNatS00(vuz180, vuz181)
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Zero) → new_primDivNatS(new_primMinusNatS2(vuz180, vuz181), Succ(vuz181))
new_primDivNatS(Succ(Succ(vuz4500)), Succ(vuz31000)) → new_primDivNatS0(vuz4500, vuz31000, vuz4500, vuz31000)
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Succ(vuz1830)) → new_primDivNatS0(vuz180, vuz181, vuz1820, vuz1830)
new_primDivNatS00(vuz180, vuz181) → new_primDivNatS(new_primMinusNatS2(vuz180, vuz181), Succ(vuz181))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Zero) → new_primDivNatS(new_primMinusNatS2(vuz180, vuz181), Succ(vuz181))
new_primDivNatS(Succ(Succ(vuz4500)), Succ(vuz31000)) → new_primDivNatS0(vuz4500, vuz31000, vuz4500, vuz31000)
new_primDivNatS00(vuz180, vuz181) → new_primDivNatS(new_primMinusNatS2(vuz180, vuz181), Succ(vuz181))

The remaining pairs can at least be oriented weakly.

new_primDivNatS0(vuz180, vuz181, Zero, Zero) → new_primDivNatS00(vuz180, vuz181)
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Succ(vuz1830)) → new_primDivNatS0(vuz180, vuz181, vuz1820, vuz1830)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primDivNatS(x₁, x₂)) = x₁
POL(new_primDivNatS0(x₁, x₂, x₃, x₄)) = 1 + x₁
POL(new_primDivNatS00(x₁, x₂)) = 1 + x₁
POL(new_primMinusNatS2(x₁, x₂)) = x₁

The following usable rules [17] were oriented:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz180, vuz181, Zero, Zero) → new_primDivNatS00(vuz180, vuz181)
new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Succ(vuz1830)) → new_primDivNatS0(vuz180, vuz181, vuz1820, vuz1830)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Succ(vuz1830)) → new_primDivNatS0(vuz180, vuz181, vuz1820, vuz1830)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Succ(vuz1830)) → new_primDivNatS0(vuz180, vuz181, vuz1820, vuz1830)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ DependencyGraphProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Succ(vuz1830)) → new_primDivNatS0(vuz180, vuz181, vuz1820, vuz1830)

From the DPs we obtained the following set of size-change graphs:

new_primDivNatS0(vuz180, vuz181, Succ(vuz1820), Succ(vuz1830)) → new_primDivNatS0(vuz180, vuz181, vuz1820, vuz1830)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz160, Succ(Succ(vuz17000)), Succ(vuz1620), vuz169) → new_quot(vuz160, vuz17000, Succ(vuz1620), vuz17000, vuz1620)
new_quot0(vuz160, Succ(Succ(vuz17000)), Zero, vuz169) → new_quot0(vuz160, new_primMinusNatS2(Succ(vuz17000), Zero), Zero, new_primMinusNatS2(Succ(vuz17000), Zero))
new_quot0(vuz160, Succ(Zero), Zero, vuz169) → new_quot0(vuz160, new_primMinusNatS2(Zero, Zero), Zero, new_primMinusNatS2(Zero, Zero))
new_quot(vuz213, vuz214, vuz215, Zero, Succ(vuz2170)) → new_quot1(vuz213, vuz215, Succ(vuz214))
new_quot2(vuz213, vuz214, vuz215) → new_quot0(vuz213, new_primMinusNatS2(Succ(vuz214), vuz215), vuz215, new_primMinusNatS2(Succ(vuz214), vuz215))
new_quot(vuz213, vuz214, vuz215, Succ(vuz2160), Succ(vuz2170)) → new_quot(vuz213, vuz214, vuz215, vuz2160, vuz2170)
new_quot(vuz213, vuz214, vuz215, Succ(vuz2160), Zero) → new_quot0(vuz213, new_primMinusNatS2(Succ(vuz214), vuz215), vuz215, new_primMinusNatS2(Succ(vuz214), vuz215))
new_quot1(vuz63, vuz640, vuz3100) → new_quot3(vuz63, vuz640, vuz3100)
new_quot0(vuz160, Succ(Zero), Succ(vuz1620), vuz169) → new_quot1(vuz160, Succ(vuz1620), Zero)
new_quot3(vuz63, vuz640, vuz3100) → new_quot3(vuz63, vuz640, vuz3100)
new_quot(vuz213, vuz214, vuz215, Zero, Zero) → new_quot2(vuz213, vuz214, vuz215)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 3 SCCs with 4 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                ↳ QDP

                                ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot3(vuz63, vuz640, vuz3100) → new_quot3(vuz63, vuz640, vuz3100)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                ↳ QDP

                                ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot3(vuz63, vuz640, vuz3100) → new_quot3(vuz63, vuz640, vuz3100)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ NonTerminationProof

                                ↳ QDP

                                ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot3(vuz63, vuz640, vuz3100) → new_quot3(vuz63, vuz640, vuz3100)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

The TRS P consists of the following rules:

new_quot3(vuz63, vuz640, vuz3100) → new_quot3(vuz63, vuz640, vuz3100)

The TRS R consists of the following rules:none

s = new_quot3(vuz63, vuz640, vuz3100) evaluates to t =new_quot3(vuz63, vuz640, vuz3100)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_quot3(vuz63, vuz640, vuz3100) to new_quot3(vuz63, vuz640, vuz3100).

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz160, Succ(Succ(vuz17000)), Zero, vuz169) → new_quot0(vuz160, new_primMinusNatS2(Succ(vuz17000), Zero), Zero, new_primMinusNatS2(Succ(vuz17000), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ RuleRemovalProof

                                ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz160, Succ(Succ(vuz17000)), Zero, vuz169) → new_quot0(vuz160, new_primMinusNatS2(Succ(vuz17000), Zero), Zero, new_primMinusNatS2(Succ(vuz17000), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

new_quot0(vuz160, Succ(Succ(vuz17000)), Zero, vuz169) → new_quot0(vuz160, new_primMinusNatS2(Succ(vuz17000), Zero), Zero, new_primMinusNatS2(Succ(vuz17000), Zero))

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + 2·x₁
POL(Zero) = 0
POL(new_primMinusNatS2(x₁, x₂)) = x₁ + 2·x₂
POL(new_quot0(x₁, x₂, x₃, x₄)) = x₁ + x₂ + x₃ + x₄

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ RuleRemovalProof

                                        ↳ QDP

                                          ↳ PisEmptyProof

                                ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
P is empty.
The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz160, Succ(Succ(vuz17000)), Succ(vuz1620), vuz169) → new_quot(vuz160, vuz17000, Succ(vuz1620), vuz17000, vuz1620)
new_quot2(vuz213, vuz214, vuz215) → new_quot0(vuz213, new_primMinusNatS2(Succ(vuz214), vuz215), vuz215, new_primMinusNatS2(Succ(vuz214), vuz215))
new_quot(vuz213, vuz214, vuz215, Succ(vuz2160), Succ(vuz2170)) → new_quot(vuz213, vuz214, vuz215, vuz2160, vuz2170)
new_quot(vuz213, vuz214, vuz215, Succ(vuz2160), Zero) → new_quot0(vuz213, new_primMinusNatS2(Succ(vuz214), vuz215), vuz215, new_primMinusNatS2(Succ(vuz214), vuz215))
new_quot(vuz213, vuz214, vuz215, Zero, Zero) → new_quot2(vuz213, vuz214, vuz215)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_quot0(vuz160, Succ(Succ(vuz17000)), Succ(vuz1620), vuz169) → new_quot(vuz160, vuz17000, Succ(vuz1620), vuz17000, vuz1620)

The remaining pairs can at least be oriented weakly.

new_quot2(vuz213, vuz214, vuz215) → new_quot0(vuz213, new_primMinusNatS2(Succ(vuz214), vuz215), vuz215, new_primMinusNatS2(Succ(vuz214), vuz215))
new_quot(vuz213, vuz214, vuz215, Succ(vuz2160), Succ(vuz2170)) → new_quot(vuz213, vuz214, vuz215, vuz2160, vuz2170)
new_quot(vuz213, vuz214, vuz215, Succ(vuz2160), Zero) → new_quot0(vuz213, new_primMinusNatS2(Succ(vuz214), vuz215), vuz215, new_primMinusNatS2(Succ(vuz214), vuz215))
new_quot(vuz213, vuz214, vuz215, Zero, Zero) → new_quot2(vuz213, vuz214, vuz215)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primMinusNatS2(x₁, x₂)) = x₁
POL(new_quot(x₁, x₂, x₃, x₄, x₅)) = 1 + x₂ + x₃
POL(new_quot0(x₁, x₂, x₃, x₄)) = x₂ + x₃
POL(new_quot2(x₁, x₂, x₃)) = 1 + x₂ + x₃

The following usable rules [17] were oriented:

new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)
new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot2(vuz213, vuz214, vuz215) → new_quot0(vuz213, new_primMinusNatS2(Succ(vuz214), vuz215), vuz215, new_primMinusNatS2(Succ(vuz214), vuz215))
new_quot(vuz213, vuz214, vuz215, Succ(vuz2160), Zero) → new_quot0(vuz213, new_primMinusNatS2(Succ(vuz214), vuz215), vuz215, new_primMinusNatS2(Succ(vuz214), vuz215))
new_quot(vuz213, vuz214, vuz215, Succ(vuz2160), Succ(vuz2170)) → new_quot(vuz213, vuz214, vuz215, vuz2160, vuz2170)
new_quot(vuz213, vuz214, vuz215, Zero, Zero) → new_quot2(vuz213, vuz214, vuz215)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                                        ↳ QDP

                                          ↳ UsableRulesProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot(vuz213, vuz214, vuz215, Succ(vuz2160), Succ(vuz2170)) → new_quot(vuz213, vuz214, vuz215, vuz2160, vuz2170)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot(vuz213, vuz214, vuz215, Succ(vuz2160), Succ(vuz2170)) → new_quot(vuz213, vuz214, vuz215, vuz2160, vuz2170)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPSizeChangeProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot(vuz213, vuz214, vuz215, Succ(vuz2160), Succ(vuz2170)) → new_quot(vuz213, vuz214, vuz215, vuz2160, vuz2170)

From the DPs we obtained the following set of size-change graphs:

new_quot(vuz213, vuz214, vuz215, Succ(vuz2160), Succ(vuz2170)) → new_quot(vuz213, vuz214, vuz215, vuz2160, vuz2170)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz146, Succ(Succ(vuz15800)), Succ(vuz1480), vuz157) → new_quot7(vuz146, vuz15800, Succ(vuz1480), vuz15800, vuz1480)
new_quot6(vuz146, Succ(Zero), Zero, vuz157) → new_quot6(vuz146, new_primMinusNatS2(Zero, Zero), Zero, new_primMinusNatS2(Zero, Zero))
new_quot7(vuz199, vuz200, vuz201, Succ(vuz2020), Succ(vuz2030)) → new_quot7(vuz199, vuz200, vuz201, vuz2020, vuz2030)
new_quot6(vuz146, Succ(Succ(vuz15800)), Zero, vuz157) → new_quot6(vuz146, new_primMinusNatS2(Succ(vuz15800), Zero), Zero, new_primMinusNatS2(Succ(vuz15800), Zero))
new_quot8(vuz45, vuz460, vuz3100) → new_quot5(vuz45, vuz460, vuz3100)
new_quot4(vuz45, vuz460, vuz3100) → new_quot5(vuz45, vuz460, vuz3100)
new_quot7(vuz199, vuz200, vuz201, Zero, Succ(vuz2030)) → new_quot8(vuz199, vuz201, Succ(vuz200))
new_quot7(vuz199, vuz200, vuz201, Zero, Zero) → new_quot9(vuz199, vuz200, vuz201)
new_quot6(vuz146, Succ(Zero), Succ(vuz1480), vuz157) → new_quot8(vuz146, Succ(vuz1480), Zero)
new_quot9(vuz199, vuz200, vuz201) → new_quot6(vuz199, new_primMinusNatS2(Succ(vuz200), vuz201), vuz201, new_primMinusNatS2(Succ(vuz200), vuz201))
new_quot5(vuz45, vuz460, vuz3100) → new_quot5(vuz45, vuz460, vuz3100)
new_quot7(vuz199, vuz200, vuz201, Succ(vuz2020), Zero) → new_quot6(vuz199, new_primMinusNatS2(Succ(vuz200), vuz201), vuz201, new_primMinusNatS2(Succ(vuz200), vuz201))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 3 SCCs with 5 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                ↳ QDP

                                ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz45, vuz460, vuz3100) → new_quot5(vuz45, vuz460, vuz3100)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                ↳ QDP

                                ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz45, vuz460, vuz3100) → new_quot5(vuz45, vuz460, vuz3100)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ NonTerminationProof

                                ↳ QDP

                                ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot5(vuz45, vuz460, vuz3100) → new_quot5(vuz45, vuz460, vuz3100)

The TRS R consists of the following rules:none

s = new_quot5(vuz45, vuz460, vuz3100) evaluates to t =new_quot5(vuz45, vuz460, vuz3100)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_quot5(vuz45, vuz460, vuz3100) to new_quot5(vuz45, vuz460, vuz3100).

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz146, Succ(Succ(vuz15800)), Zero, vuz157) → new_quot6(vuz146, new_primMinusNatS2(Succ(vuz15800), Zero), Zero, new_primMinusNatS2(Succ(vuz15800), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ RuleRemovalProof

                                ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz146, Succ(Succ(vuz15800)), Zero, vuz157) → new_quot6(vuz146, new_primMinusNatS2(Succ(vuz15800), Zero), Zero, new_primMinusNatS2(Succ(vuz15800), Zero))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

new_quot6(vuz146, Succ(Succ(vuz15800)), Zero, vuz157) → new_quot6(vuz146, new_primMinusNatS2(Succ(vuz15800), Zero), Zero, new_primMinusNatS2(Succ(vuz15800), Zero))

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + 2·x₁
POL(Zero) = 0
POL(new_primMinusNatS2(x₁, x₂)) = x₁ + 2·x₂
POL(new_quot6(x₁, x₂, x₃, x₄)) = x₁ + x₂ + x₃ + x₄

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ RuleRemovalProof

                                        ↳ QDP

                                          ↳ PisEmptyProof

                                ↳ QDP

                      ↳ Narrow

Q DP problem:
P is empty.
The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot7(vuz199, vuz200, vuz201, Succ(vuz2020), Succ(vuz2030)) → new_quot7(vuz199, vuz200, vuz201, vuz2020, vuz2030)
new_quot6(vuz146, Succ(Succ(vuz15800)), Succ(vuz1480), vuz157) → new_quot7(vuz146, vuz15800, Succ(vuz1480), vuz15800, vuz1480)
new_quot7(vuz199, vuz200, vuz201, Zero, Zero) → new_quot9(vuz199, vuz200, vuz201)
new_quot9(vuz199, vuz200, vuz201) → new_quot6(vuz199, new_primMinusNatS2(Succ(vuz200), vuz201), vuz201, new_primMinusNatS2(Succ(vuz200), vuz201))
new_quot7(vuz199, vuz200, vuz201, Succ(vuz2020), Zero) → new_quot6(vuz199, new_primMinusNatS2(Succ(vuz200), vuz201), vuz201, new_primMinusNatS2(Succ(vuz200), vuz201))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_quot6(vuz146, Succ(Succ(vuz15800)), Succ(vuz1480), vuz157) → new_quot7(vuz146, vuz15800, Succ(vuz1480), vuz15800, vuz1480)

The remaining pairs can at least be oriented weakly.

new_quot7(vuz199, vuz200, vuz201, Succ(vuz2020), Succ(vuz2030)) → new_quot7(vuz199, vuz200, vuz201, vuz2020, vuz2030)
new_quot7(vuz199, vuz200, vuz201, Zero, Zero) → new_quot9(vuz199, vuz200, vuz201)
new_quot9(vuz199, vuz200, vuz201) → new_quot6(vuz199, new_primMinusNatS2(Succ(vuz200), vuz201), vuz201, new_primMinusNatS2(Succ(vuz200), vuz201))
new_quot7(vuz199, vuz200, vuz201, Succ(vuz2020), Zero) → new_quot6(vuz199, new_primMinusNatS2(Succ(vuz200), vuz201), vuz201, new_primMinusNatS2(Succ(vuz200), vuz201))

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_primMinusNatS2(x₁, x₂)) = x₁
POL(new_quot6(x₁, x₂, x₃, x₄)) = x₂
POL(new_quot7(x₁, x₂, x₃, x₄, x₅)) = 1 + x₂
POL(new_quot9(x₁, x₂, x₃)) = 1 + x₂

The following usable rules [17] were oriented:

new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)
new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot7(vuz199, vuz200, vuz201, Succ(vuz2020), Succ(vuz2030)) → new_quot7(vuz199, vuz200, vuz201, vuz2020, vuz2030)
new_quot7(vuz199, vuz200, vuz201, Zero, Zero) → new_quot9(vuz199, vuz200, vuz201)
new_quot9(vuz199, vuz200, vuz201) → new_quot6(vuz199, new_primMinusNatS2(Succ(vuz200), vuz201), vuz201, new_primMinusNatS2(Succ(vuz200), vuz201))
new_quot7(vuz199, vuz200, vuz201, Succ(vuz2020), Zero) → new_quot6(vuz199, new_primMinusNatS2(Succ(vuz200), vuz201), vuz201, new_primMinusNatS2(Succ(vuz200), vuz201))

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                                        ↳ QDP

                                          ↳ UsableRulesProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot7(vuz199, vuz200, vuz201, Succ(vuz2020), Succ(vuz2030)) → new_quot7(vuz199, vuz200, vuz201, vuz2020, vuz2030)

The TRS R consists of the following rules:

new_primMinusNatS2(Succ(vuz12700), Succ(vuz1280)) → new_primMinusNatS2(vuz12700, vuz1280)
new_primMinusNatS2(Zero, Succ(vuz1280)) → Zero
new_primMinusNatS2(Zero, Zero) → Zero
new_primMinusNatS2(Succ(vuz12700), Zero) → Succ(vuz12700)

The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot7(vuz199, vuz200, vuz201, Succ(vuz2020), Succ(vuz2030)) → new_quot7(vuz199, vuz200, vuz201, vuz2020, vuz2030)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS2(Zero, Succ(x0))
new_primMinusNatS2(Succ(x0), Zero)
new_primMinusNatS2(Zero, Zero)
new_primMinusNatS2(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPOrderProof

                                    ↳ QDP

                                      ↳ DependencyGraphProof

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ QReductionProof

                                                ↳ QDP

                                                  ↳ QDPSizeChangeProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot7(vuz199, vuz200, vuz201, Succ(vuz2020), Succ(vuz2030)) → new_quot7(vuz199, vuz200, vuz201, vuz2020, vuz2030)

From the DPs we obtained the following set of size-change graphs:

new_quot7(vuz199, vuz200, vuz201, Succ(vuz2020), Succ(vuz2030)) → new_quot7(vuz199, vuz200, vuz201, vuz2020, vuz2030)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5

Haskell To QDPs

primDivNatS0	x y True	= Succ (primDivNatS (primMinusNatS x y) (Succ y))
primDivNatS0	x y False	= Zero

primModNatS0	x y True	= primModNatS (primMinusNatS x y) (Succ y)
primModNatS0	x y False	= Succ x

gcd2	True yz zu	= gcd1 (zu == 0) yz zu
gcd2	zy zz vuu	= gcd0 zz vuu

signumReal2	x True	= 0
signumReal2	x False	= signumReal1 x (x > 0)

signumReal1	x True	= 1
signumReal1	x False	= signumReal0 x otherwise

reduce2Reduce1	vux vuy x y True	= error []
reduce2Reduce1	vux vuy x y False	= reduce2Reduce0 vux vuy x y otherwise

gcd0Gcd'2	x xz	= gcd0Gcd'1 (xz == 0) x xz
gcd0Gcd'2	yx yy	= gcd0Gcd'0 yx yy